On constant composition codes

Authors:
Wensong Chu;Charles J. Colbourn;Peter Dukes
Affiliations:
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-5406, USA;Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-5406, USA;Department of Mathematics and Statistics, University of Victoria, Victoria, BC, Canada V8W 3P4
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 10
Cited 6

Finite fields

Finite fields
Constructions for Permutation Codes in Powerline Communications

Designs, Codes and Cryptography
Packing arrays

Theoretical Computer Science - Latin American theorotical informatics
Bounds and constructions for ternary constant-composition codes

IEEE Transactions on Information Theory
A new table of constant weight codes

IEEE Transactions on Information Theory
Families of sequences with optimal Hamming-correlation properties

IEEE Transactions on Information Theory
Distance-preserving mappings from binary vectors to permutations

IEEE Transactions on Information Theory
Permutation arrays for powerline communication and mutually orthogonal latin squares

IEEE Transactions on Information Theory
Optimal frequency hopping sequences: a combinatorial approach

IEEE Transactions on Information Theory
Power line communications: state of the art and future trends

IEEE Communications Magazine

A Construction of Optimal Constant Composition Codes

Designs, Codes and Cryptography
Equidistant frequency permutation arrays and related constant composition codes

Designs, Codes and Cryptography
Modelling equidistant frequency permutation arrays: an application of constraints to mathematics

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Linear size optimal q-ary constant-weight codes and constant-composition codes

IEEE Transactions on Information Theory
Isometries and construction of permutation arrays

IEEE Transactions on Information Theory
Constructing Constant Composition Codes via Distance-Increasing Mappings

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.16

Visualization

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.