Codes from the line graphs of complete multipartite graphs and PD-sets

被引：7
作者：
Key, J. D. [1 ]
Seneviratne, P. [1 ]
机构：
[1] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA
来源：
DISCRETE MATHEMATICS | 2007年 / 307卷 / 17-18期
关键词：
codes; graphs; designs;
D O I：
10.1016/j.disc.2006.11.008
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The binary codes of the line graphs L-m (n) of the complete multipartite graphs K-n1.....nm 1 11 (n(i) = n for 1 <= i <= m) n >= 2,m >= 3 are examined, and PD-sets and s-PD-sets are found. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：2217 / 2225
页数：9
相关论文
共 14 条
[1]  
ASSMUS EF, 1993, 1992 CAMBRIDGE TRACT, V103
[2]  
Bosma W., 1994, Handbook of Magma functions
[3]   MINIMAL PERMUTATION SETS FOR DECODING THE BINARY GOLAY CODES [J].
GORDON, DM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (03) :541-543
[4]  
Huffman WC, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P1345
[5]   Binary codes from rectangular lattice graphs and permutation decoding [J].
Key, J. D. ;
Seneviratne, P. .
EUROPEAN JOURNAL OF COMBINATORICS, 2007, 28 (01) :121-126
[6]  
Key JD, 2006, ARS COMBINATORIA, V79, P11
[7]   Information sets and partial permutation decoding for codes from finite geometries [J].
Key, JD ;
McDonough, TP ;
Mavron, VC .
FINITE FIELDS AND THEIR APPLICATIONS, 2006, 12 (02) :232-247
[8]   Partial permutation decoding for codes from finite planes [J].
Key, JD ;
McDonough, TP ;
Mavron, VC .
EUROPEAN JOURNAL OF COMBINATORICS, 2005, 26 (05) :665-682
[9]   Permutation decoding for the binary codes from triangular graphs [J].
Key, JD ;
Moori, J ;
Rodrigues, BG .
EUROPEAN JOURNAL OF COMBINATORICS, 2004, 25 (01) :113-123
[10]  
KEY JD, IN PRESS DISCRETE MA
12