High-rate LDPC codes from partially balanced incomplete block designs
From MaRDI portal
Publication:2114791
Coding theorems (Shannon theory) (94A24) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)
Recommendations
- Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
- scientific article; zbMATH DE number 2127872
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
- Construction of short block length,high rate low-density parity-check codes based on cyclic difference families
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cites work
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 1982620 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
- Constructions of difference covering arrays.
- Cyclic difference packing and covering arrays.
- Difference covering arrays and pseudo-orthogonal Latin squares
- Good error-correcting codes based on very sparse matrices
- High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes
- Incidence matrices and inequalities for combinatorial designs
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
This page was built for publication: High-rate LDPC codes from partially balanced incomplete block designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114791)