Two constructions of permutation arrays

被引：25

作者：

Fu, FW ^{[1
]}

Klove, T

机构：

[1] Natl Univ Singapore, Temasek Labs, Singapore 119260, Singapore

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

[3] Univ Bergen, Dept Informat, N-5020 Bergen, Norway

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2004年 / 50卷 / 05期

关键词：

bounds; code constructions; permutation arrays;

D O I：

10.1109/TIT.2004.826659

中图分类号：

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

学科分类号：

0812 ;

摘要：

In this correspondence, two new constructions of permutation arrays are given. A number of examples to illustrate the constructions are also provided.

引用

页码：881 / 883

页数：3

共 17 条

[1] CODING WITH PERMUTATIONS [J].

BLAKE, IF ;

COHEN, G ;

DEZA, M .

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

[2]

CHU W, UNPUB CONSTRUCTIONS

[3]

COLBOURN CJ, IN PRESS IEEE T INFO

[4] BOUNDS FOR PERMUTATION ARRAYS [J].

DEZA, M ;

VANSTONE, SA .

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

[5] Constructions of permutation arrays [J].

Ding, CS ;

Fu, FW ;

Klove, T ;

Wei, VKW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (04) :977-980

[6]

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

[7] 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

[8] Gray isometries for finite chain rings and a nonlinear ternary (36,312,15) code [J].

Greferath, M ;

Schmidt, SE .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) :2522-2524

[9]

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

[10] Overlarge sets of 2-(11,5,2) designs and related configurations [J].

Mathon, R ;

Street, AP .

DISCRETE MATHEMATICS, 2002, 255 (1-3) :275-286

← 1 2 →