| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421046 | Discrete Applied Mathematics | 2006 | 18 Pages |
Abstract
A constant composition code over a k-ary alphabet has the property that the numbers of occurrences of the k symbols within a codeword is the same for each codeword. These specialize to constant weight codes in the binary case, and permutation codes in the case that each symbol occurs exactly once. Constant composition codes arise in powerline communication and balanced scheduling, and are used in the construction of permutation codes. In this paper, direct and recursive methods are developed for the construction of constant composition codes.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wensong Chu, Charles J. Colbourn, Peter Dukes,