Pseudocodewords of Parity-Check Codes Over Fields of Prime Cardinality

• Published in: IEEE transactions on information theory Vol. 60; no. 9; pp. 5215 - 5227
• Main Authors: Kositwattanarerk, Wittawat, Matthews, Gretchen L.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.09.2014; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Applied sciences; Coding, codes; Density; Exact sciences and technology; Information theory; Information, signal and communications theory; Iterative decoding; Linear matrix inequalities; Linear programming; Mapping; Matrix; Maximum likelihood decoding; Parity; Signal and communications theory; Symmetry; Telecommunications and information theory; Vectors; irreducible pseudocodewords; fundamental cone; low-density parity-check (LDPC) code; pseudocodewords; nonbinary code; Iterative decoding; Alphabet; Polytope; Lower bound; Finite field; Necessary and sufficient condition; Linear programming; Mapping; Algorithm; Necessary condition; Error correcting code; Parity check codes; Parity check

This paper considers pseudocodewords of lowdensity parity-check codes over alphabets with prime cardinality p for use over the p-ary symmetric channel. Pseudocodewords are decoding algorithm outputs that may not be legitimate codewords. Here, we consider pseudocodewords arising from graph cover deco...