On the nonexistence of completely transitive codes

被引：10
|
作者：
Borges, J [1 ]
Rifà, J [1 ]
机构：
[1] Univ Autonoma Barcelona, Dept Informat, Bellaterra 08193, Spain
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2000年 / 46卷 / 01期
关键词：
completely regular codes; completely transitive codes; permutation groups;
D O I：
10.1109/18.817528
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Completely transitive codes were introduced by P, Sole as a special case of binary linear completely regular codes. The existence of such codes is closely related to the existence of certain permutation groups. The nonexistence of highly transitive permutation groups allows us to prove the nonexistence of completely transitive codes with error-correcting capability greater than 4.
引用
收藏
页码：279 / 280
页数：2
相关论文
共 50 条
  • [1] COMPLETELY REGULAR CODES AND COMPLETELY TRANSITIVE CODES
    SOLE, P
    [J]. DISCRETE MATHEMATICS, 1990, 81 (02) : 193 - 201
  • [2] Nonexistence of completely transitive codes with error-correcting capability e > 3
    Borges, J
    Rifà, J
    Zinoviev, V
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) : 1619 - 1621
  • [3] COMPLETELY TRANSITIVE CODES AND DISTANCE TRANSITIVE GRAPHS
    RIFA, J
    PUJOL, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 539 : 360 - 367
  • [4] On completely regular and completely transitive supplementary codes
    Borges, J.
    Rifa, J.
    Zinoviev, V. A.
    [J]. DISCRETE MATHEMATICS, 2020, 343 (03)
  • [5] Families of completely transitive codes and distance transitive graphs
    Borges, J.
    Rifa, J.
    Zinoviev, V. A.
    [J]. DISCRETE MATHEMATICS, 2014, 324 : 68 - 71
  • [6] Completely transitive codes in hamming graphs
    Giudici, M
    Praeger, CE
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (07) : 647 - 661
  • [7] Conway Groupoids and Completely Transitive Codes
    Nick Gill
    Neil I. Gillespie
    Jason Semeraro
    [J]. Combinatorica, 2018, 38 : 399 - 442
  • [8] Conway Groupoids and Completely Transitive Codes
    Gill, Nick
    Gillespie, Neil I.
    Semeraro, Jason
    [J]. COMBINATORICA, 2018, 38 (02) : 399 - 442
  • [9] On new infinite families of completely regular and completely transitive codes
    Borges, J.
    Rifa, J.
    Zinoviev, V.
    [J]. DISCRETE MATHEMATICS, 2024, 347 (04)
  • [10] On a family of binary completely transitive codes with growing covering radius
    Rifa, Josep
    Zinoviev, Victor A.
    [J]. DISCRETE MATHEMATICS, 2014, 318 : 48 - 52
12345