Constructions of permutation arrays

被引：43

作者：

Ding, CS ^{[1
]}

Fu, FW

Klove, T

Wei, VKW

机构：

[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China

[2] Nankai Univ, Dept Math, Tianjin 300071, Peoples R China

[3] Chinese Univ Hong Kong, Dept Informat Engn, Shatin, Hong Kong, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 04期

关键词：

code construction; permutation array (PA); permutation code;

D O I：

10.1109/18.992812

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A permutation array (PA) of length n and minimum distance d is a set of permutations of n elements such that any two permutations coincide in at most n - d positions. Some constructions of PAs are given.

引用

页码：977 / 980

页数：4

共 12 条

[1] CODING WITH PERMUTATIONS [J].

BLAKE, IF ;

COHEN, G ;

DEZA, M .

INFORMATION AND CONTROL, 1979, 43 (01) :1-19

[2]

Colbourn C. J., 1996, The CRC handbook of combinatorial designs

[3] BOUNDS FOR PERMUTATION ARRAYS [J].

DEZA, M ;

VANSTONE, SA .

JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1978, 2 (02) :197-209

[4]

FERREIRA HC, P IEEE VEH TECHN C, P2401

[5] MAXIMUM NUMBER OF PERMUTATIONS WITH GIVEN MAXIMAL OR MINIMAL DISTANCE [J].

FRANKL, P ;

DEZA, M .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1977, 22 (03) :352-360

[6]

KLOVE T, 2000, P INT S INF THEOR IT, P465

[7]

Klove T., 2000, P NORSK INF NIK, P55

[8] Upper bounds on permutation codes via linear programming [J].

Tarnanen, H .

EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (01) :101-114

[9]

Vinck A. J. H., 2000, P INT S POW LIN COMM

[10]

Vinck AJH, 2000, AEU-INT J ELECTRON C, V54, P45

← 1 2 →