Binary codes from graphs on triples

被引：15
作者：
Key, JD [1 ]
Moori, J
Rodrigues, BG
机构：
[1] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA
[2] Univ Natal, Sch Math Stat & Informat Technol, ZA-3209 Pietermaritzburg, South Africa
来源：
DISCRETE MATHEMATICS | 2004年 / 282卷 / 1-3期
关键词：
codes; graphs; designs;
D O I：
10.1016/j.disc.2003.12.004
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a set Omega of size n greater than or equal to 7 and Omega({3}) the set of subsets of Omega of size 3, we examine the binary codes obtained from the adjacency matrix of each of the three graphs with vertex set Omega({3}) with adjacency defined by two vertices as 3-sets being adjacent if they have zero, one or two elements in common, respectively. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：171 / 182
页数：12
相关论文
共 11 条
[1]  
[Anonymous], 1983, THEORY ERROR CORRECT
[2]  
[Anonymous], 1984, Enumeration and design
[3]  
Bosma W., HDB MAGMA FUNCTIONS
[4]  
Brouwer A. E., 1992, J ALGEBR COMB, V1, P329
[5]   Binary codes of strongly regular graphs [J].
Haemers, WH ;
Peeters, R ;
Van Rijckevorsel, JM .
DESIGNS CODES AND CRYPTOGRAPHY, 1999, 17 (1-3) :187-209
[6]  
Huffman WC, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P1345
[7]  
Key J.D., 1992, DESIGNS THEIR CODES, V103
[8]  
Key J. D., 1996, CODE GEOM, V9, P7, DOI [10.1007/BF00169770, DOI 10.1007/BF00169770]
[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, PERMUTATION DECODING
12