Bulletin of the Korean Mathematical Society (대한수학회보)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

NEW RESULTS ON THE PSEUDOREDUNDANCY

  • Greferath, Marcus (Department of Mathematics and Systems Analysis Aalto University) ;
  • Liu, Zihui (Department of Mathematics Beijing Institute of Technology) ;
  • Wu, Xin-Wen (Department of Mathematical and Computer Sciences Indiana University of Pennsylvania) ;
  • Zumbragel, Jens (Laboratory for Cryptologic Algorithms EPFL)
  • Received : 2018.02.14
  • Accepted : 2018.07.13
  • Published : 2019.01.31
Download PDF
⟨ Previous Next ⟩

Abstract

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ø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.

Keywords

References

  1. W. D. Chen and T. Klve, The weight hierarchies of q-ary codes of dimension 4, IEEE Trans. Inform. Theory 42 (1996), no. 6, part 2, 2265-2272. https://doi.org/10.1109/18.556621
  2. T. Etzion, A. Trachtenberg, and A. Vardy, Which codes have cycle-free Tanner graphs?, IEEE Trans. Inform. Theory 45 (1999), no. 6, 2173-2181. https://doi.org/10.1109/18.782170
  3. J. Feldman, M. J. Wainwright, and D. R. Karger, Using linear programming to decode binary linear codes, IEEE Trans. Inform. Theory 51 (2005), no. 3, 954-972. https://doi.org/10.1109/TIT.2004.842696
  4. G. D. Forney, R. Koetter, F. R. Kschischang, and A. Reznik, On the effective weights of pseudocodewords for codes defined on graphs with cycles, in Codes, systems, and graphical models (Minneapolis, MN, 1999), 101-112, IMA Vol. Math. Appl., 123, Springer, New York, 2001.
  5. C. A. Kelley and D. Sridhara, On the pseudocodeword weight and parity-check matrix redundancy of linear codes, In: Proc. 2007 IEEE Information Theory Workshop (ITW), Lake Tahoe, USA, 2007.
  6. Z. Liu and W. Chen, Notes on the value function, Des. Codes Cryptogr. 54 (2010), no. 1, 11-19. https://doi.org/10.1007/s10623-009-9305-z
  7. Z. Liu and X.-W. Wu, On relative constant-weight codes, Des. Codes Cryptogr. 75 (2015), no. 1, 127-144. https://doi.org/10.1007/s10623-013-9896-2
  8. Z. Liu, J. Zumbragel, M. Greferath, and X.-W. Wu, Notes on the pseudoredundancy, In: Proc. 2014 IEEE International Symposium on Information Theory (ISIT 2014), Honolulu, USA, pp. 2789-2793, 2014.
  9. M. Schwartz and A. Vardy, On the stopping distance and the stopping redundancy of codes, IEEE Trans. Inform. Theory 52 (2006), no. 3, 922-932. https://doi.org/10.1109/TIT.2005.864441
  10. P. O. Vontobel and R. Koetter, Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes, CoRR Dec. 2005 [Online] Available: http://arxiv.org/abs/cs/051207.
  11. J. Zumbragel, V. Skachek, and M. F. Flanagan, On the pseudocodeword redundancy of binary linear codes, IEEE Trans. Inform. Theory 58 (2012), no. 7, 4848-4861. https://doi.org/10.1109/TIT.2012.2193661