Graph-based convolutional and block LDPC codes
From MaRDI portal
Publication:2269366
DOI10.1134/S0032946009040061zbMath1191.94124MaRDI QIDQ2269366
R. V. Satyukov, Irina E. Bocharova, Boris D. Kudryashov
Publication date: 16 March 2010
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Quasi-cyclic LDPC codes of column-weight two using a search algorithm
- Ramanujan graphs
- Explicit constructions of graphs without short cycles and low density codes
- Constructions for cubic graphs with large girth
- New upper bounds on the order of cages
- Voltage graphs, group presentations and cages
- Dynamic cage survey
- A Connection Between Block and Convolutional Codes
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Regular and irregular progressive edge-growth tanner graphs
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$
- On Tail Biting Convolutional Codes
- A recursive approach to low complexity codes
- Generalized Hamming weights for linear codes
- Design of capacity-approaching irregular low-density parity-check codes
- Deriving Good LDPC Convolutional Codes from LDPC Block Codes
