Some new efficient second-order spectral-null codes with small lookup tables

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 paper, 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.