By Topic

Constructions for optimal constant weight cyclically permutable codes and difference families

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Bitan ; Comput. Sci. Dept., Israel Inst. of Technol., Haifa, Israel ; T. Etzion

A cyclically permutable code is a binary code whose codewords are cyclically distinct and have full cyclic order. An important class of these codes are the constant weight cyclically permutable codes. In a code of this class all codewords have the same weight w. These codes have wide applications, e.g., in optical code-division multiple access communication systems and in constructing protocol-sequence sets for the M-active-out-of-T users collision channel without feedback. In this paper we construct optimal constant weight cyclically permutable codes with length n, weight w, and minimum Hamming distance 2w-2. Some of these codes coincide with the well known design called difference family

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994