Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds

DOI10.1109/TIT.2011.2173244zbMath1365.94651arXiv0901.4129OpenAlexW3125301056MaRDI QIDQ5272093

Pascal O. Vontobel, Roxana Smarandache

Publication date: 12 July 2017

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

Full work available at URL: https://arxiv.org/abs/0901.4129

Mathematics Subject Classification ID

Bounds on codes (94B65) Convolutional codes (94B10)

Related Items (1)

(7,K) GIRTH-8 QC-LDPC CODES WITH AN EXPLICIT CONSTRUCTION

This page was built for publication: Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds