Equidistant frequency permutation arrays and related constant composition codes

Authors:
Sophie Huczynska
Affiliations:
School of Mathematics and Statistics, University of St Andrews, Fife, Scotland, UK KY16 9SS
Venue:
Designs, Codes and Cryptography
Year:
2010

Citing 6
Cited 1

Constructions for Permutation Codes in Powerline Communications

Designs, Codes and Cryptography
A Construction of Optimal Constant Composition Codes

Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
On constant composition codes

Discrete Applied Mathematics
On constant-composition codes over Zq

IEEE Transactions on Information Theory
Combinatorial constructions of optimal constant-composition codes

IEEE Transactions on Information Theory

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the special class of equidistant constant composition codes of type CCC(n, d, μ m ) (where n = m μ), which correspond to equidistant frequency permutation arrays; we also consider related codes with composition "close to" μ m . We establish various properties of these objects and give constructions for optimal families of codes.