|
Title:
|
The PBD-closure of constant-composition codes.
|
|
Author:
|
Chee, Yeow Meng.; Ling, Alan C. H.; Ling, San.; Shen, Hao.
|
|
Copyright year:
|
2007 |
|
Abstract:
|
We show an interesting pairwise balanced design (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 sizes 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. |
|
Subject:
|
DRNTU::Science::Mathematics::Discrete mathematics::Combinatorics. |
|
Type:
|
Journal Article |
|
Series/ Journal Title:
|
IEEE Transactions on Information Theory. |
|
School:
|
School of Physical and Mathematical Sciences |
|
Rights:
|
IEEE Transactions on Information Theory © copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site. |
|
Version:
|
Published version |
