Regular and irregular progressive edge-growth tanner graphs
From MaRDI portal
(Redirected from Regular and irregular progressive edge-growth tanner graphs)
Recommendations
- Improved low-density parity-check codes using irregular graphs
- Efficient encoding of low-density parity-check codes
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
- scientific article; zbMATH DE number 1775410
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
Cited in
(27)- Fundamental finite key limits for one-way information reconciliation in quantum key distribution
- A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices
- On the construction of stabilizer codes with an arbitrary binary matrix
- A performance analysis of quantum low-density parity-check codes for correcting correlated errors
- Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
- Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis
- Multiple accumulated-crossover parallel concatenated SPC codes
- Graph-based convolutional and block LDPC codes
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- Study on the distribution law of random code structure of irregular ldpc codes and its application in eliminating short cycles
- Lowering the error floor of Gallager codes: a statistical-mechanical view
- A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences
- TS-LDPC Codes: Turbo-Structured Codes With Large Girth
- Tanner graphs for group block codes and lattices: construction and complexity
- 4-cycle free APM-LDPC codes with an explicit construction
- On the class of array-based APM-LDPC codes
- Counting short cycles of \((c,d)\)-regular bipartite graphs
- Asymptotically good homological error correcting codes
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Hardware design and implementation of high-speed multidimensional reconciliation sender module in continuous-variable quantum key distribution
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems
- Efficient information reconciliation in quantum key distribution systems using informed design of non-binary LDPC codes
- Efficient information reconciliation for high-dimensional quantum key distribution
- An efficient algorithm for counting cycles in QC and APM LDPC codes
- Upper bounds on the minimum distance of LDPC codes with double diagonal parity checks
- Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis
This page was built for publication: Regular and irregular progressive edge-growth tanner graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547029)
