Codes from incidence matrices and line graphs of Hamming graphs

被引:23
作者
Fish, W. [1 ]
Key, J. D. [1 ]
Mwambene, E. [1 ]
机构
[1] Univ Western Cape, Dept Math & Appl Math, ZA-7535 Bellville, South Africa
关键词
Hamming graphs; Line graphs; Incidence matrices; Codes; SETS;
D O I
10.1016/j.disc.2010.02.010
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We examine the p-ary codes, for any prime p, that can be obtained from incidence matrices and line graphs of the Hamming graphs, H(n, m), obtaining the main parameters of these codes. We show that the codes from the incidence matrices of H(n. m) can be used for full permutation decoding for all m, n >= 3. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1884 / 1897
页数:14
相关论文
共 20 条
[1]  
[Anonymous], 1983, THEORY ERROR CORRECT
[2]  
[Anonymous], ERGEBNISSE MATH IH 3
[3]  
Assmus Jr. E.F., 1993, CAMBRIDGE TRACTS MAT, V103
[4]  
Assmus Jr. E.F., 1992, CAMBRIDGE TRACTS MAT, V103
[5]   The Magma algebra system .1. The user language [J].
Bosma, W ;
Cannon, J ;
Playoust, C .
JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (3-4) :235-265
[6]  
Bosma W., 2006, HDB MAGMA FUNCTIONS, P3951
[7]   Graphs, designs and codes related to the n-cube [J].
Fish, W. ;
Key, J. D. ;
Mwambene, E. .
DISCRETE MATHEMATICS, 2009, 309 (10) :3255-3269
[8]  
Fish W., 2009, J COMBIN INFORM SYST, V34, P169
[9]  
FISH W, J SYMBOLIC IN PRESS
[10]   MINIMAL PERMUTATION SETS FOR DECODING THE BINARY GOLAY CODES [J].
GORDON, DM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (03) :541-543