High-rate LDPC codes from partially balanced incomplete block designs

DOI10.1007/s10801-021-01111-0OpenAlexW4207072041MaRDI QIDQ2114791

Elif Üsküplü, Emine ŞYazıcı, Aiden Price, A. Baliga, Diane M. Donovan

Publication date: 15 March 2022

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-021-01111-0

zbMATH Keywords

LDPC codescombinatorial constructiondifference covering arrayspartial BIBDs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Orthogonal arrays, Latin squares, Room squares (05B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60) Coding theorems (Shannon theory) (94A24)

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructions of difference covering arrays.
• Cyclic difference packing and covering arrays.
• Difference covering arrays and pseudo-orthogonal Latin squares
• Incidence matrices and inequalities for combinatorial designs
• Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
• High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Good error-correcting codes based on very sparse matrices

This page was built for publication: High-rate LDPC codes from partially balanced incomplete block designs