This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation
August 2006 (vol. 55 no. 8)
pp. 929-946
A symbol permutation invariant balanced (SPI-balanced) code over the alphabet {\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}_m=\{0,1,\ldots,m-1\} is a block code over {\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}_m such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason, every permutation among the symbols of the alphabet changes an SPI-balanced code into an SPI-balanced code. This means that SPI--balanced words are "the most balanced” among all possible m{\hbox{-}}\rm ary balanced word types and this property makes them very attractive from the application perspective. In particular, they can be used to achieve m{\hbox{-}}\rm ary DC-free communication, to detect/correct asymmetric/unidirectional errors on the m{\hbox{-}}\rm ary asymmetric/unidirectional channel, to achieve delay-insensitive communication, to maintain data integrity in digital optical disks, and so on. This paper gives some efficient methods to convert (encode) m{\hbox{-}}\rm ary information sequences into m{\hbox{-}}\rm ary SPI-balanced codes whose redundancy is equal to roughly double the minimum possible redundancy r_{min}. It is proven that r_{min} \simeq [(m-1)/2]\log_{m}n-(1/2)[1-(1/\log_{2\pi}m)]m-(1/\log_{2\pi}m) for any code which converts k information digits into an SPI-balanced code of length n=k+r. For example, the first method given in the paper encodes k information digits into an SPI-balanced code of length n=k+r, with r=(m-1)\log_{m}k+O(m\log_{m}\log_{m}k). A second method is a recursive method, which uses the first as base code and encodes k digits into an SPI-balanced code of length n=k+r, with r\simeq(m-1)\log_{m}n-\log_{m}[(m-1)!].

[1] S. Al-Bassam and B. Bose, “Design of Efficient Balanced Codes,” IEEE Trans. Computers, vol. 43, no. 3, pp. 362-365, Mar. 1994.
[2] G.E. Andrews, “The Theory of Partitions,” Encyclopedia of Math. and Its Applications, vol. 2, 1976.
[3] A. Baliga and S. Boztaş, “Balancing Sets of Non-Binary Vectors,” Proc. IEEE Int'l Symp. Information Theory, p. 300, July 2002.
[4] M. Blaum and J. Bruck, “Coding for Delay-Insensitive Communication with Partial Synchronization,” IEEE Trans. Information Theory, vol. 40, no. 3, pp. 941-945, May 1994.
[5] T.M. Cover, “Enumerative Source Encoding,” IEEE Trans. Information Theory, vol. 19, no. 1, pp. 73-77, Jan. 1973.
[6] D.E. Knuth, “Efficient Balanced Codes,” IEEE Trans. Information Theory, vol. 32, no. 1, pp. 51-53, 1986.
[7] R. Mascella, L.G. Tallini, S. Al-Bassam, and B. Bose, “On Efficient Balanced Codes over the $m\rm th$ Roots of Unity,” IEEE Trans. Information Theory, vol. 52, no. 5, pp. 2214-2217, 2006.
[8] L.G. Tallini, R.M. Capocelli, and B. Bose, “Design of Some New Efficient Balanced Codes,” IEEE Trans. Information Theory, vol. 42, no. 3, pp. 790-802, 1996.
[9] L.G. Tallini and U. Vaccaro, “Efficient $m{\hbox{-}}\rm Ary$ Balanced Codes,” Discrete Applied Math., vol. 92, no. 1, pp. 17-56, Mar. 1999.

Index Terms:
Coding and information theory, error control codes, balanced codes, constant weight codes, digital communication, m{\hbox{-}}\rm ary communication, line codes, DC-free communication, delay-insensitive communication.
Citation:
Raffaele Mascella, Luca G. Tallini, "Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation," IEEE Transactions on Computers, vol. 55, no. 8, pp. 929-946, Aug. 2006, doi:10.1109/TC.2006.124
Usage of this product signifies your acceptance of the Terms of Use.