On constant composition codes

被引：68

作者：

Chu, WS ^{[1
]}

Colbourn, CJ

Dukes, P

机构：

[1] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85287 USA

[2] Univ Victoria, Dept Math & Stat, Victoria, BC V8W 3P4, Canada

来源：

DISCRETE APPLIED MATHEMATICS | 2006年 / 154卷 / 06期

关键词：

constant composition code; constant weight code; permutation code;

D O I：

10.1016/j.dam.2005.09.009

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：912 / 929

页数：18

共 19 条

[1] Reactive local search for the maximum clique problem [J].

Battiti, R ;

Protasi, M .

ALGORITHMICA, 2001, 29 (04) :610-637

[2] A NEW TABLE OF CONSTANT WEIGHT CODES [J].

BROUWER, AE ;

SHEARER, JB ;

SLOANE, NJA ;

SMITH, WD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) :1334-1380

[3] Distance-preserving mappings from binary vectors to permutations [J].

Chang, JC ;

Chen, RJ ;

Klove, T ;

Tsai, SC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (04) :1054-1059

[4]

CHU W, 2005, J COMBIN MATH COMBIN, V54, P57

[5] Constructions for permutation codes in powerline communications [J].

Chu, WS ;

Colbourn, CJ ;

Dukes, P .

DESIGNS CODES AND CRYPTOGRAPHY, 2004, 32 (1-3) :51-64

[6] Permutation arrays for powerline communication and mutually orthogonal Latin squares [J].

Colbourn, CJ ;

Klove, T ;

Ling, ACH .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) :1289-1291

[7]

Danziger P, 2001, J COMB DES, V9, P79, DOI 10.1002/1520-6610(2001)9:2<79::AID-JCD1000>3.0.CO

[8]

2-B

[9]

Ferreira HC, 2000, IEEE VTS VEH TECHNOL, P2401, DOI 10.1109/VETECF.2000.883295

[10] Optimal frequency hopping sequences: A combinatorial approach [J].

Fuji-Hara, R ;

Miao, Y ;

Mishima, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2408-2420

← 1 2 →