The PBD-Closure of Constant-Composition Codes

Details The PBD-Closure of Constant-Composition Codes The PBD-Closure of Constant-Composition Codes

2007-12-16

arxiv.org/abs/0712.2552v1

IEEE Transactions on Information Theory, vol. 53, No. 8, August 2007, pp. 2685-2692

Computer Science

Information Theory

8 pages

Scientific paper

10.1109/TIT.2007.901175

We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the size of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven.

Affiliated with

Also associated with

No associations

Rating

The PBD-Closure of Constant-Composition Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The PBD-Closure of Constant-Composition Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The PBD-Closure of Constant-Composition Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445877