Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes

In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study their minimal codewords and pseudo-codewords, as it is known that these vectors characterize completely the code performance under maximum-likelihood decoding and linear programming decoding, respectively. The main results of this paper consist of upper and lower bounds on the pseudo-weight of the minimal pseudo-codewords of type-I PG-LDPC codes.

[1]  Roxana Smarandache,et al.  On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes , 2005, ArXiv.

[2]  D. Avis.  A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm , 2000 .

[3]  Jason Teutsch,et al.  On the minimal pseudo-codewords of codes from finite geometries , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[4]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[5]  Suquan Ding.  Iterative Decoding of L-step Majority-Logic Decodable Codes Based on Belief Propagation , 2007, International Conference on Wireless Communications, Networking and Mobile Computing.

[6]  D. Avis.  lrs : A Revised Implementation of the Rev rse Search Vertex Enumeration Algorithm , 1998 .

[7]  Shu Lin,et al.  Iterative decoding of one-step majority logic deductible codes based on belief propagation , 2000, IEEE Trans. Commun..

[8]  R. Koetter,et al.  On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles , 2001 .

[9]  A. Barlotti,et al.  Combinatorics of Finite Geometries , 1975 .

[10]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[11]  P. Vontobel,et al.  Graph-covers and iterative decoding of nite length codes , 2003 .

[12]  Jon Feldman,et al.  Decoding error-correcting codes via linear programming , 2003 .

[13]  Ralf Koetter,et al.  Lower bounds on the minimum pseudoweight of linear codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..