2014/10/07 by Zihui Liu, Jens Zumbrägel, Liu, Zihui +5
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1410.1627
16 pages
arxiv created 2014/10/07 · openalex publication_date 2014/10/07 · arxiv updated 2014/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.