New results on the pseudoredundancy
From MaRDI portal
Publication:4968623
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.
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
Cites work
- scientific article; zbMATH DE number 1714650 (Why is no real title available?)
- Eigenvalue bounds on the pseudocodeword weight of expander codes
- Notes on the value function
- On relative constant-weight codes
- On the Pseudocodeword Redundancy of Binary Linear Codes
- On the stopping distance and the stopping redundancy of codes
- The weight hierarchies of q-ary codes of dimension 4
- Using Linear Programming to Decode Binary Linear Codes
- Which codes have cycle-free Tanner graphs?
Cited in
(2)
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)
