New results on the Pseudoredundancy

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

  • Beijing Institute of Technology
  • Indiana University of Pennsylvania
  • EPFL Valais Wallis

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.

Details

Original languageEnglish
Pages (from-to)111-130
Number of pages20
JournalBULLETIN OF THE KOREAN MATHEMATICAL SOCIETY
Volume56
Issue number1
Publication statusPublished - 1 Jan 2019
MoE publication typeA1 Journal article-refereed

    Research areas

  • Fundamental cone, LDPC codes, Pseudocodeword redundancy, Pseudoweight, Subcode-complete, Value assignment

ID: 39038358