Finite fields
Constructions for Permutation Codes in Powerline Communications
Designs, Codes and Cryptography
Theoretical Computer Science - Latin American theorotical informatics
Bounds and constructions for ternary constant-composition codes
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
Generalized balanced tournament designs and related codes
Designs, Codes and Cryptography
Constructions of partitioned difference families
European Journal of Combinatorics
Constructions of optimal GDRP(n,λ;v)'s of type λ1µm-1
Discrete Applied Mathematics
A class of optimal constant composition codes from GDRPs
Designs, Codes and Cryptography
Distance-increasing mappings from binary vectors to constant composition vectors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Hi-index | 0.04 |
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.