Copyright © 2008 The Institute of Electronics, Information and Communication Engineers
Regular Section -- Letters -- Coding Theory |
Binary Constant Weight Codes Based on Cyclic Difference Sets*
1 The authors are with the Faculty of Mathematics and Computer Science, Hubei University, Wuhan, 430062, China. X. Zeng is the corresponding author. E-mail: xzeng{at}hubu.edu.cn, 2 The author is with the State Key Laboratory of Information Security (Graduate School of Chinese Academy of Sciences), 19A Yuquan Road, Beijing 100049, P.R. China. E-mail: hu{at}is.ac.cn
Based on cyclic difference sets, sequences with two-valued autocorrelation can be constructed. Using these constructed sequences, two classes of binary constant weight codes are presented. Some codes proposed in this paper are proven to be optimal.
Key Words: cyclic difference set, sequence with two-valued autocorrelation, constant weight code, Hamming distance
Manuscript received August 17, 2007. Manuscript revised January 9, 2008.
* The work of N. Li and X. Zeng was supported in part by the National Science Foundation of China (NSFC) under Grant 60603012 and L. Hu's work was supported in part by the NSFC under Grant 60573053.
References
[1] L.D. Baumert, Cyclic difference sets, Springer-Verlag, New York, 1971. [2] Y.M. Chee and S. Ling, "Constructions for q-ary constant-weight codes," IEEE Trans. Inf. Theory, vol.53, no.1, pp.135–146, Jan. 2007. [3] P. Charpin, A. Tietavainen, and V. Zinoviev, "On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property," IEEE Trans. Inf. Theory, vol.47, no.1, pp.421–425, Jan. 2001. [4] F.W. Fu, A.J. Han Vinck, and S.Y. Shen, "On the construction of constant-weight codes," IEEE Trans. Inf. Theory, vol.44, no.1, pp.328–333, Jan. 1998. [5] D.M. Gordon, Cyclic difference set. Available online, http://www.ccrwest.org/diffsets/ds_list.pdf [6] S.W. Golomb and G. Gong, "Periodic binary sequences with the trinomial property," IEEE Trans. Inf. Theory, vol.45, no.4, pp.1276–1279, May 1999. [7] S.M. Johnson, "A new upper bound for error-correcting codes," IEEE Trans. Inf. Theory, vol.8, no.3, pp.203–207, April 1962. [8] F.J. MacWilliams and N.J.A. Sloane, The theory of error-correcting codes, Part [9] Q.A. Nguyen, L. Györfi, and J.L. Massey, "Constructions of binary constant weight cyclic codes and cyclically permutable codes," IEEE Trans. Inf. Theory, vol.38, no.3, pp.940–949, May 1992. [10] E.M. Rains and N.J.A. Sloane, Table of constant weight binary codes. Available online, http://www.research.att.com/~njas/codes/Andw/ [11] C. Xing and J. Ling, "A construction of binary constant-weight codes from algebraic curves over finite fields," IEEE Trans. Inf. Theory, vol.51, no.10, pp.3674–3678, Oct. 2005. [12] E. Agrell, A. Vardy, and K. Zeger, "Upper bounds for constant-weight codes," IEEE Trans. Inf. Theory, vol.46, no.7, pp.2373–2395, Nov. 2000. [13] F.X. Zeng, "Properties of m-sequence and construction of constant weight codes," IEICE Trans. Fundamentals, vol.E88-A, no.12, pp.3675–3676. Dec. 2005.
North-Holland, New York, 1977.
CiteULike 
Connotea 
Del.icio.us What's this?
This Article 
Abstract
Full Text (PDF)
Alert me when this article is cited
Alert me if a correction is posted
Services
Email this article to a friend
Similar articles in this journal
Alert me to new issues of the journal
Add to My Personal Archive
Download to citation manager
Request Permissions
Google Scholar
Articles by LI, N.
Articles by HU, L.
Social Bookmarking
What's this?