Improved Nearly-MDS Expander Codes
From MaRDI portal
Publication:3548010
DOI10.1109/TIT.2006.878232zbMath1309.94082arXivcs/0601090OpenAlexW3102535214MaRDI QIDQ3548010
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0601090
Related Items (3)
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs ⋮ The Minimum Distance of Graph Codes ⋮ A combination of testability and decodability by tensor products
This page was built for publication: Improved Nearly-MDS Expander Codes