Binary Codes and Partial Permutation Decoding Sets from the Johnson Graphs

被引:6
|
作者
Fish, W. [1 ]
机构
[1] Univ Western Cape, Dept Math & Appl Math, ZA-7535 Bellville, South Africa
关键词
Johnson graphs; Binary codes; Automorphism group; Permutation decoding;
D O I
10.1007/s00373-014-1485-2
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For , , the Johnson graph denoted by is the graph with vertex-set the set of all -subsets of , and any two vertices and are adjacent if and only if . In this paper the binary codes and their duals generated by an adjacency matrix of are described. The automorphism groups of the codes are determined, and by identifying suitable information sets, 3-PD-sets are determined for the code when is even.
引用
收藏
页码:1381 / 1396
页数:16
相关论文
共 50 条