Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes

DOI10.1109/TIT.2013.2279831zbMath1364.94614OpenAlexW1973896237MaRDI QIDQ5346254

Jin-Ho Chung, Kyeongcheol Yang, Kyung Joong Kim

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2013.2279831

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (4)

Dual of codes over finite quotients of polynomial rings ⋮ On the search of smallest QC-LDPC code with girth six and eight ⋮ (7,K) GIRTH-8 QC-LDPC CODES WITH AN EXPLICIT CONSTRUCTION ⋮ Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers

This page was built for publication: Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes