New Results on the Pseudoredundancy

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kl{\o}ve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

[1]  Mark F. Flanagan,et al.  On the Pseudocodeword Redundancy of Binary Linear Codes , 2011, IEEE Transactions on Information Theory.

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

[3]  T. Etzion,et al.  Which codes have cycle-free Tanner graphs? , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[4]  P. Vontobel,et al.  Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.

[5]  Xin-Wen Wu,et al.  On relative constant-weight codes , 2015, Des. Codes Cryptogr..

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

[7]  Wende Chen,et al.  Notes on the value function , 2010, Des. Codes Cryptogr..

[8]  D. Sridhara,et al.  On the pseudocodeword weight and parity-check matrix redundancy of linear codes , 2007, 2007 IEEE Information Theory Workshop.

[9]  Xin-Wen Wu,et al.  Notes on the pseudoredundancy , 2014, 2014 IEEE International Symposium on Information Theory.

[10]  Torleiv Kløve,et al.  The weight hierarchies of q -ary codes of dimension 4 , 1996, IEEE Trans. Inf. Theory.

[11]  Alexander Vardy,et al.  On the stopping distance and the stopping redundancy of codes , 2006, IEEE Transactions on Information Theory.