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
基金
澳大利亚研究理事会;
关键词
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 条
  • [31] Combinatorial PDEs on Hamming graphs
    Barletta, E
    Dragomir, S
    [J]. DISCRETE MATHEMATICS, 2002, 254 (1-3) : 1 - 18
  • [32] Spectral characterization of the Hamming graphs
    Bang, Sejeong
    van Dam, Edwin R.
    Koolen, Jack H.
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 429 (11-12) : 2678 - 2686
  • [33] Retracts of infinite Hamming graphs
    Chastand, M
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 71 (01) : 54 - 66
  • [34] ISOMETRIC EMBEDDINGS IN HAMMING GRAPHS
    WILKEIT, E
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 50 (02) : 179 - 197
  • [35] Hamming codes are rate-efficient array codes
    Vallés, EL
    Casado, AIV
    Blaum, M
    Villasenor, J
    Wesel, RD
    [J]. GLOBECOM '05: IEEE Global Telecommunications Conference, Vols 1-6: DISCOVERY PAST AND FUTURE, 2005, : 1320 - 1324
  • [36] Characterizing subgraphs of Hamming graphs
    Klavzar, S
    Peterin, I
    [J]. JOURNAL OF GRAPH THEORY, 2005, 49 (04) : 302 - 312
  • [37] Error correcting codes2. The Hamming codes
    Priti Shankar
    [J]. Resonance, 1997, 2 (1) : 34 - 43
  • [38] WOM-CODES CONSTRUCTED FROM HAMMING CODES
    GODLEWSKI, P
    [J]. DISCRETE MATHEMATICS, 1987, 65 (03) : 237 - 243
  • [39] Lattices associated with Hamming graphs
    Qi, Jinyun
    Zhang, Baohuan
    Li, Zengti
    [J]. ARS COMBINATORIA, 2016, 128 : 47 - 53
  • [40] Elusive extremal graphs
    Grzesik, Andrzej
    Kral, Daniel
    Lovasz, Laszlo Miklos
    [J]. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2020, 121 (06) : 1685 - 1736