This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some New Efficient Second-Order Spectral-Null Codes with Small Lookup Tables
July 2006 (vol. 55 no. 7)
pp. 924-927
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.

[1] E.L. Leiss, “Data Integrity in Digital Optical Disks,” IEEE Trans. Computers, vol. 33, no. 9, pp. 818-827, Sept. 1984.
[2] K.A.S. Immink, Coding Techniques for Digital Recorders. London: Prentice-Hall, 1991.
[3] E.E. Bergmann, D. Coppersmith, A.M. Odlyzko, and S.H. Sangani, “Half Weight Block Codes for Optical Communications,” AT&T Technical J., vol. 65, pp. 85-93, May/June 1986.
[4] J.M. Berger, “A Note on Error Detecting Codes for Asymmetric Channels,” Information Control, vol. 4, pp. 68-73, Mar. 1961.
[5] R.M. Roth, P.H. Siegel, and A. Vardy, “High-Order Spectral-Null Codes-Construction and Bounds,” IEEE Trans. Information Theory, vol. 40 pp. 1826-1840, Nov. 1994.
[6] K.A.S. Immink, “Spectrum Shaping with Binary DC$^2$ -Constrained Channel Codes,” Philips J. Research, vol. 40, pp. 40-53, 1985.
[7] Y. Xin and I.J. Fair, “Algorithms to Enumerate Codewords for DC$^2$ -Constrained Channels,” IEEE Trans. Information Theory, vol. 47, pp. 3020-3025, Nov. 2001.
[8] L.G. Tallini and B. Bose, “On Efficient High-Order Spectral-Null Codes,” IEEE Trans. Information Theory, vol. 45, pp. 2594-2601, Nov. 1999.
[9] C.N. Yang, “Design of Efficient Second-Order Spectral-Null Codes,” IEEE Trans. Information Theory, vol. 51, pp. 1580-1584, Apr. 2005.
[10] B. Bose and T.R.N. Rao, “Theory of Unidirectional Error Correcting/Detecting Codes,” IEEE Trans. Computers, vol. 31, no. 6, pp. 521-530, June 1982.
[11] D.E. Knuth, “Efficient Balanced Codes,” IEEE Trans. Information Theory, vol. 32, pp. 51-53, Jan. 1986.
[12] S. Al-Bassam and B. Bose, “Design of Efficient Balanced Codes,” IEEE Trans. Computers, vol. 43, no. 3, pp. 362-365, Mar. 1994.
[13] L.G. Tallini, R.M. Capocelli, and B. Bose, “Design of Some New Efficient Balanced Codes,” IEEE Trans. Information Theory, vol. 42, pp. 790-802, May 1996.

Index Terms:
Balanced codes, dc-free codes, high-order spectral-null codes, 1--EC/AUED codes.
Citation:
Ching-Nung Yang, Dong-Jing Lee, "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
Usage of this product signifies your acceptance of the Terms of Use.