New results on the pseudoredundancy

DOI10.4134/BKMS.B180141zbMATH Open1411.94099arXiv1410.1627OpenAlexW2963111854MaRDI QIDQ4968623FDOQ4968623

Authors: Marcus Greferath, Xin-Wen Wu, Jens Zumbrägel, Zihui Liu 

Publication date: 16 July 2019

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

Full work available at URL: https://arxiv.org/abs/1410.1627

Recommendations

• Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
• Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes
• Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights
• An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
• Minimum distance and pseudodistance lower bounds for generalised LDPC codes

zbMATH Keywords

LDPC codesfundamental conevalue assignmentpseudoweightpseudocodeword redundancysubcode-complete

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• On relative constant-weight codes
• Using Linear Programming to Decode Binary Linear Codes
• The weight hierarchies of q-ary codes of dimension 4
• On the Pseudocodeword Redundancy of Binary Linear Codes
• Notes on the value function
• Which codes have cycle-free Tanner graphs?
• On the stopping distance and the stopping redundancy of codes
• Eigenvalue bounds on the pseudocodeword weight of expander codes
• Title not available (Why is that?)

Cited In (2)

• Value functions and two classes of binary codes
• Title not available (Why is that?)

This page was built for publication: New results on the pseudoredundancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968623)