Partial permutation decoding of some binary codes from graphs on triples

被引:0
|
作者
Key, J. D. [1 ]
Moori, J. [2 ]
Rodrigues, B. G. [3 ]
机构
[1] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA
[2] Univ KwaZulu Natal, Sch Math Sci, ZA-3209 Pietermaritzburg, South Africa
[3] Univ KwaZulu Natal, Sch Math Sci, ZA-4041 Durban, South Africa
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that partial permutation decoding can be used, and give explicit s-PD-sets in the symmetric group, where s is less than the full error-correction capability of the code, for some classes of binary codes obtained from the adjacency matrices of the graphs with vertices the ((n)(3)) 3-subsets of a set of size n with adjacency defined by the vertices as 3-sets being adjacent if they have a fixed number of elements in common.
引用
收藏
页码:363 / 371
页数:9
相关论文
共 50 条