Issue No.07 - July (2006 vol.55)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2006.111
Tallini and Bose introduced a recursive method to construct second-order spectral-null codes which result in short (information length 16) base optimal second-order spectral-null codes that can be easily implemented either with table lookup or enumerative coding. In this brief contribution, the extended base suboptimal second-order spectral-null codes (17 information length 32) obtained from two short base codes by lookup table are used to reduce the overall code length.
Balanced codes, dc-free codes, high-order spectral-null codes, 1--EC/AUED codes.
Ching-Nung Yang, "Some New Efficient Second-Order Spectral-Null Codes with Small Lookup Tables", IEEE Transactions on Computers, vol.55, no. 7, pp. 924-927, July 2006, doi:10.1109/TC.2006.111