Skip Navigation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2008 E91-A(5):1288-1292; doi:10.1093/ietfec/e91-a.5.1288
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by LI, N.
Right arrow Articles by HU, L.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Coding Theory

Binary Constant Weight Codes Based on Cyclic Difference Sets*

Nian LI1, Xiangyong ZENG1 and Lei HU2

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


  Abstract

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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.