On the minimum distance of array codes as LDPC codes
From MaRDI portal
Publication:3547199
DOI10.1109/TIT.2003.820053zbMath1286.94113MaRDI QIDQ3547199
Tor Helleseth, Kyeongcheol Yang
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (2)
Minimum distances of three families of low-density parity-check codes based on finite geometries ⋮ New and explicit constructions of unbalanced Ramanujan bipartite graphs
This page was built for publication: On the minimum distance of array codes as LDPC codes