TY - GEN
T1 - Enumerable multi-track (d,k) block codes
AU - Orcutt, Edward K.
AU - Marcellin, Michael W.
PY - 1993
Y1 - 1993
N2 - Recently, a new class of run-length-limited codes, referred to as 2-D or multi-track modulation codes, has been developed. In this paper, we propose a method to construct multi-track (d, k) block codes which can be implemented using an enumeration scheme based on a trellis. While block codes can be implemented via look-up tables, the amount of memory required for such an implementation increases exponentially with the block length. Out method is a computational algorithm which requires only a linear increase of memory (and computations) with block length.
AB - Recently, a new class of run-length-limited codes, referred to as 2-D or multi-track modulation codes, has been developed. In this paper, we propose a method to construct multi-track (d, k) block codes which can be implemented using an enumeration scheme based on a trellis. While block codes can be implemented via look-up tables, the amount of memory required for such an implementation increases exponentially with the block length. Out method is a computational algorithm which requires only a linear increase of memory (and computations) with block length.
UR - http://www.scopus.com/inward/record.url?scp=0027228996&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027228996&partnerID=8YFLogxK
M3 - Conference contribution
SN - 0780308786
T3 - Proceedings of the 1993 IEEE International Symposium on Information Theory
SP - 5
BT - Proceedings of the 1993 IEEE International Symposium on Information Theory
PB - Publ by IEEE
T2 - Proceedings of the 1993 IEEE International Symposium on Information Theory
Y2 - 17 January 1993 through 22 January 1993
ER -