Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators

DOI10.1109/TIT.2007.915923zbMath1311.94122arXivcs/0607024OpenAlexW2172152579MaRDI QIDQ3604706

J. H. Weber, Khaled A. S. Abdel-Ghaffar

Publication date: 24 February 2009

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

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

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (1)

On the minimum stopping sets of product codes

This page was built for publication: Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators