New families of completely regular codes and their corresponding distance regular coset graphs

被引：0

作者：

Joaquim Borges

Josep Rifà

Victor Zinoviev

机构：

[1] Universitat Autònoma de Barcelona,Department of Information and Communications Engineering

[2] Russian Academy of Sciences,Institute for Problems of Information Transmission

来源：

Designs, Codes and Cryptography | 2014年 / 70卷

关键词：

Completely regular codes; Distance regular graphs; -Designs; 94B25; 94B60;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper three new infinite families of linear binary completely regular codes are constructed. They have covering radius ρ = 3 and 4, and are halves of binary Hamming and binary extended Hamming codes of length n = 2m−1 and 2m, where m is even. There are also shown some combinatorial (binomial) identities which are new, to our knowledge.These completely regular codes induce, in the usual way, i.e., as coset graphs, three infinite families of distance-regular graphs of diameter three and four. This description of such graphs is new.

引用

页码：139 / 148

页数：9

共 39 条

[1] Bassalygo L.A.(1977)A note on uniformly packed codes Problems Inf. Transm. 13 22-25
[2] Zinoviev V.A.(1974)Uniformly packed codes Problems Inf. Transm. 10 9-14
[3] Bassalygo L.A.(2003)On IEEE Trans. Inf. Theory 49 2834-2843
[4] Zaitsev G.V.(2008)-linear Preparata-like and Kerdock-like codes Discret. Math. 308 3508-3525
[5] Zinoviev V.A.(2010)On non-antipodal binary completely regular codes Adv. Math. Commun. 4 567-578
[6] Borges J.(1995)On J. Algebr. Comb. 4 317-327
[7] Rifa J.(1973)-ary linear completely regular codes with ρ = 2 and antipodal dual Philips Res. Rep. Suppl. 10 1-97
[8] Phelps K.P.(2007)A family of antipodal distance-regular graphs related to the classical Preparata codes Sib. Math. J. 48 923-930
[9] Zinoviev V.A.(2007)An algebraic approach to the association schemes of coding theory Sib. Electron. Math. Rep. 4 292-295
[10] Borges J.(1992)Perfect 2-coloring of hypercube J. Comb. Theory B 56 205-238

← 1 2 3 4 →