FAMILIES OF NESTED COMPLETELY REGULAR CODES AND DISTANCE-REGULAR GRAPHS

被引：3

作者：

Borges, Joaquim ^{[1
]}

Rifa, Josep ^{[1
]}

Zinoviev, Victor A. ^{[2
]}

机构：

[1] Univ Autonoma Barcelona, Dept Informat & Commun Engn, Bellaterra 08193, Cerdanyola Del, Spain

[2] Russian Acad Sci, AA Kharkevich Inst Problems Informat Transmiss, Moscow 127994, Russia

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2015年 / 9卷 / 02期

关键词：

Completely regular codes; completely transitive codes; distance-regular graphs; distance-transitive graphs; TRANSITIVE CODES; COVERS;

D O I：

10.3934/amc.2015.9.233

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius rho equal to 3 or 4 , and are 1/2(i)th parts, for i epsilon{1, ... ,u} of binary (respectively, extended binary) Hamming codes of length n=2(m) -1 (respectively, 2(m) ), where m=2u . In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D equal to 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.

引用

页码：233 / 246

页数：14

共 16 条

[1]

BASSALYGO LA, 1977, PROBL INFORM TRANSM+, V13, P22

[2]

BASSALYGO LA, 1974, PROBL PEREDACHI INF, V10, P9

[3] Families of completely transitive codes and distance transitive graphs [J].

Borges, J. ;

Rifa, J. ;

Zinoviev, V. A. .

DISCRETE MATHEMATICS, 2014, 324 :68-71

[4] New families of completely regular codes and their corresponding distance regular coset graphs [J].

Borges, Joaquim ;

Rifa, Josep ;

Zinoviev, Victor .

DESIGNS CODES AND CRYPTOGRAPHY, 2014, 70 (1-2) :139-148

[5]

Brouwer A.E., 1989, Distance-Regular Graphs

[6]

CALDERBANK AR, 1984, PHILIPS J RES, V39, P143

[7]

Delsarte P., 1973, THESIS KATHOLIEKE U

[8]

Gardiner A., 1974, Journal of Combinatorial Theory, Series B, V16, P255, DOI 10.1016/0095-8956(74)90072-0

[9] Completely transitive codes in hamming graphs [J].

Giudici, M ;

Praeger, CE .

EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (07) :647-661

[10] DISTANCE REGULAR COVERS OF THE COMPLETE GRAPH [J].

GODSIL, CD ;

HENSEL, AD .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1992, 56 (02) :205-238

← 1 2 →