This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Analysis and Design of Group Theoretical t-syEC/AUED Codes
January 1996 (vol. 45 no. 1)
pp. 103-108

Abstract—An efficient algorithm to count the cardinalities of certain subsets of constant weight binary vectors is presented in this paper. The algorithm enables us to design 1-symmetric error correcting/all unidirectional error detecting (1-syEC/AUED) codes with the highest cardinality based on the group Zn. Since a field Zp is a group, this algorithm can also be used to design a field 1-syEC/AUED code. We can construct t-syEC/AUED codes for t = 2 or 3 by appending a tail to the field 1-syEC/AUED codes. The information rates of the proposed t-syEC/AUED codes are shown to be better than the previously developed codes.

[1] W.W. Peterson and E.J. Weldon,Error Correcting Codes, 2nd ed. Cambridge, Mass.: M.I.T. Press, l972.
[2] S. Lin and D. J. Costello,Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
[3] T.R.N. Rao and Fujiwara, Error-Coding for Computer Systems.Englewood Cliffs, N.J.: Prentice Hall, 1989.
[4] D.K. Pradhan,"A new class of error-correcting/detecting codes for fault tolerant computer applications," IEEE Trans. Computers, vol. 29, no. 6, pp. 47l-48l, June 1980.
[5] B. Bose and T.R.N. Rao,"Theory of unidirectional error correcting/detecting codes," IEEE Trans. Computers, vol. 3l, no. 6, pp. 52l-530, June l982.
[6] D. Nikolos, N. Gaitanis, and G. Philokyprou, “Systematic Error Correcting/All Unidirectional Error Detecting Codes,” IEEE Trans. Computers, vol. 35, no. 5, pp. 394-402, May 1986.
[7] M. Blaum and H. Van Tilborg,"On-t-error correcting/all unidirectional error detecting codes," IEEE Trans. Computers, vol. 38, no. 11, pp. l,493-l,50l, Nov. l989.
[8] D.L. Tao,C.R.P. Hartmann, and P.K. Lala,"Systematic random error correcting and all unidirectional error detecting codes," IEEE Trans. Computers, vol. 39, no. 6, pp. 836-840, June l990.
[9] S. Kundu,"On symmetric error correcting and all unidirectional error detecting codes," IEEE Trans. Computers, vol. 39, no. 6, pp. 752-761, June 1990.
[10] D. Nikolos,"Theory and Design of t-Error correcting/d-error detecting (d > t) and all unidirectional error detecting codes," IEEE Trans. Computers, vol. 40, no. 2, pp. 132-143, Feb. 1991.
[11] D.E. Knuth, “Efficient Balanced Codes,” IEEE Trans. Information Theory, vol. 32, pp. 51-53, Jan. 1986.
[12] S.A. Bassam and B. Bose,"Design of efficient error-correcting balanced codes," IEEE Trans. Computers, vol. 42, pp. 1,261-1,266, Oct. 1993.
[13] M. Aigner,Combinatorial Theory.New York: Springer-Verlag, 1979.
[14] S. Kundu,"Design of non-symmetric 3syEC/AUED codes of asymptotically optimal order," Int'l Symp. Information Theory, Jan. 1990.

Index Terms:
Balanced codes, error correction, error detection, unidirectional errors, combinatorics, partition problems.
Citation:
Chi-Sung Laih, Ching-Nung Yang, "On the Analysis and Design of Group Theoretical t-syEC/AUED Codes," IEEE Transactions on Computers, vol. 45, no. 1, pp. 103-108, Jan. 1996, doi:10.1109/12.481491
Usage of this product signifies your acceptance of the Terms of Use.