High-rate LDPC codes from partially balanced incomplete block designs

DOI10.1007/S10801-021-01111-0OpenAlexW4207072041MaRDI QIDQ2114791FDOQ2114791

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

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

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)

Cites Work

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

Uses Software

• LDPC

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)