ELUSIVE CODES IN HAMMING GRAPHS

被引：2
|
作者：
Hawtin, Daniel R. [1 ]
Gillespie, Neil I. [1 ]
Praeger, Cheryl E. [1 ,2 ]
机构：
[1] Univ Western Australia, Crawley, WA 6009, Australia
[2] King Abdulaziz Univ, Jeddah 21413, Saudi Arabia
来源：
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 2013年 / 88卷 / 02期
基金：
澳大利亚研究理事会;
关键词：
elusive codes; permutation codes; powerline communication; neighbour transitive codes; automorphism groups; POWERLINE COMMUNICATIONS; PERMUTATION CODES;
D O I：
10.1017/S0004972713000051
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We consider a code to be a subset of the vertex set of a Hamming graph. We examine elusive pairs, code-group pairs where the code is not determined by knowledge of its set of neighbours. We construct a new infinite family of elusive pairs, where the group in question acts transitively on the set of neighbours of the code. In these examples, the alphabet size always divides the length of the code. We show that there is no elusive pair for the smallest set of parameters that does not satisfy this condition. We also pose several questions regarding elusive pairs.
引用
收藏
页码：286 / 296
页数：11
相关论文
共 50 条
  • [1] s-Elusive codes in Hamming graphs
    Daniel R. Hawtin
    [J]. Designs, Codes and Cryptography, 2021, 89 : 1211 - 1220
  • [2] s-Elusive codes in Hamming graphs
    Hawtin, Daniel R.
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (06) : 1211 - 1220
  • [3] Hamming Graphs and Permutation Codes
    Barta, Janos
    Montemanni, Roberto
    [J]. 2017 FOURTH INTERNATIONAL CONFERENCE ON MATHEMATICS AND COMPUTERS IN SCIENCES AND IN INDUSTRY (MCSI), 2017, : 154 - 158
  • [4] Neighbour transitivity on codes in Hamming graphs
    Neil I. Gillespie
    Cheryl E. Praeger
    [J]. Designs, Codes and Cryptography, 2013, 67 : 385 - 393
  • [5] Completely transitive codes in hamming graphs
    Giudici, M
    Praeger, CE
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (07) : 647 - 661
  • [6] Hamming graphs and special LCD codes
    Fish, W.
    Key, J. D.
    Mwambene, E.
    Rodrigues, B. G.
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2019, 61 (1-2) : 461 - 479
  • [7] Neighbour transitivity on codes in Hamming graphs
    Gillespie, Neil I.
    Praeger, Cheryl E.
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2013, 67 (03) : 385 - 393
  • [8] Hamming graphs and special LCD codes
    W. Fish
    J. D. Key
    E. Mwambene
    B. G. Rodrigues
    [J]. Journal of Applied Mathematics and Computing, 2019, 61 : 461 - 479
  • [9] Codes from incidence matrices and line graphs of Hamming graphs
    Fish, W.
    Key, J. D.
    Mwambene, E.
    [J]. DISCRETE MATHEMATICS, 2010, 310 (13-14) : 1884 - 1897
  • [10] CODES FROM THE INCIDENCE MATRICES AND LINE GRAPHS OF HAMMING GRAPHS Hk(n, 2) FOR k ≥ 2
    Key, Jennifer D.
    Fish, Washiela
    Mwambene, Eric
    [J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2011, 5 (02) : 373 - 394
12345