论文信息 - Notes on the pseudoredundancy

Notes on the pseudoredundancy

By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give some upper bounds on the pseudoredundancies of certain codes with repeated coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

Xin-Wen Wu | Marcus Greferath | Zihui Liu | Jens Zumbrägel

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

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

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

[4] Gou Hosoya,et al. 国際会議参加報告:2014 IEEE International Symposium on Information Theory , 2014 .

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

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

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

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

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