On constant composition codes

Wensong Chu, Charles Colbourn, Peter Dukes

Research output: Contribution to journalArticle

66 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)912-929
Number of pages18
JournalDiscrete Applied Mathematics
Volume154
Issue number6
DOIs
StatePublished - Apr 15 2006

Keywords

  • Constant composition code
  • Constant weight code
  • Permutation code

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On constant composition codes'. Together they form a unique fingerprint.

  • Cite this