Graph-based convolutional and block LDPC codes
From MaRDI portal
Recommendations
Cites work
- A Connection Between Block and Convolutional Codes
- A recursive approach to low complexity codes
- Constructions for cubic graphs with large girth
- Deriving Good LDPC Convolutional Codes from LDPC Block Codes
- Design of capacity-approaching irregular low-density parity-check codes
- Dynamic cage survey
- Explicit constructions of graphs without short cycles and low density codes
- Generalized Hamming weights for linear codes
- scientific article; zbMATH DE number 1714651 (Why is no real title available?)
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- New upper bounds on the order of cages
- On Tail Biting Convolutional Codes
- Quasi-cyclic LDPC codes of column-weight two using a search algorithm
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$
- Ramanujan graphs
- Regular and irregular progressive edge-growth tanner graphs
- Voltage graphs, group presentations and cages
Cited in
(7)- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- A low rate coding and decoding scheme based on the LDPC-BCH graph
- LDPC Block and Convolutional Codes Based on Circulant Matrices
- Laminated turbo codes: A new class of block-convolutional codes
- Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels
- Graph-Based Decoding in the Presence of ISI
- Woven convolutional graph codes with large free distances
This page was built for publication: Graph-based convolutional and block LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269366)
