Combinatorially designed LDPC codes using Zech logarithms and congruential sequences
From MaRDI portal
Recommendations
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
- Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
- Geometric constructions of Gallager codes
- Construction of short block length,high rate low-density parity-check codes based on cyclic difference families
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
Cited in
(10)- High-rate LDPC codes from partially balanced incomplete block designs
- Construction of short block length,high rate low-density parity-check codes based on cyclic difference families
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
- Shortened Array Codes of Large Girth
- TS-LDPC Codes: Turbo-Structured Codes With Large Girth
- Design of LDPC codes using iterative-filled method
- scientific article; zbMATH DE number 820496 (Why is no real title available?)
- Successive refinement for the Wyner-Ziv problem and layered code design
- Construction method of structured LDPC code with large girth
- Window code parameters of spatially-coupled LDPC codes
This page was built for publication: Combinatorially designed LDPC codes using Zech logarithms and congruential sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154863)
