NDLI: On the minimal pseudo-codewords of codes from finite geometries

Content Provider	IEEE Xplore Digital Library
Author	Vontobel, P.O. Smarandache, R. Kiyavash, N. Teutsch, J. Vukobratovic, D.
Copyright Year	2005
Description	Author affiliation: Dept. of ECE, Wisconsin Univ., Madison, WI (Vontobel, P.O.)
Abstract	In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal pseudo-codewords. This paper studies the minimal codewords and minimal pseudo-codewords of some families of codes derived from projective and Euclidean planes. Although our numerical results are only for codes of very modest length, they suggest that these code families exhibit an interesting property. Namely, all minimal pseudo-codewords that are not multiples of a minimal codeword have an AWGNC pseudo-weight that is strictly larger than the minimum Hamming weight of the code. This observation has positive consequences not only for LP decoding but also for iterative decoding
Starting Page	980
Ending Page	984
File Size	223062
Page Count	5
File Format	PDF
ISBN	0780391519
DOI	10.1109/ISIT.2005.1523484
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-09-04
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Geometry Iterative decoding Maximum likelihood decoding Parity check codes Linear programming Hamming weight Code standards Linear code Hamming distance Data communication
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes

On the minimal pseudo-codewords of codes from finite geometries (2005)

Bounds on the pseudo-weight of minimal pseudo-codewords of projective geometry codes (2005).

On the pseudocodeword weight and parity-check matrix redundancy of linear codes

Pseudo-Codewords in LDPC Convolutional Codes

Relaxation bounds on the minimum pseudo-weight of linear block codes

Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties

Minimum Pseudo-Codewords of LDPC Codes

On minimal pseudo-codewords

On the minimal pseudo-codewords of codes from finite geometries

Similar Documents

Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes

On the minimal pseudo-codewords of codes from finite geometries (2005)

Bounds on the pseudo-weight of minimal pseudo-codewords of projective geometry codes (2005).

On the pseudocodeword weight and parity-check matrix redundancy of linear codes

Pseudo-Codewords in LDPC Convolutional Codes

Relaxation bounds on the minimum pseudo-weight of linear block codes

Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties

Minimum Pseudo-Codewords of LDPC Codes

On minimal pseudo-codewords

On the minimal pseudo-codewords of codes from finite geometries