Capacity achieving code constructions for two classes of (d,k) constraints
From MaRDI portal
Publication:3547581
DOI10.1109/TIT.2006.876224zbMath1309.94083arXivcs/0411006OpenAlexW2104713578MaRDI QIDQ3547581
Steven W. McLaughlin, Yogesh Sankarasubramaniam
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/0411006
This page was built for publication: Capacity achieving code constructions for two classes of (d,k) constraints