首页|Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Taylor & Francis
We examine the p-ary linear codes from incidence matrix of the (n, k)-arrangement graphs for k = 2, n -2, n - 1. All the main parameters of the codes are obtained as [n(n - 1)(n - 2), n(n -1), 2(n - 2)](p), [n!/2(n - 2), n!, 2(n - 2)](p), [n!/2(n - 1), n!-1, n-1](p) respectively. We examine also the p-any linear codes from incidence matrix of graphs such as Ljubljana graph, Heawood graph and the main parameters of the codes are [168, 111, 3](p'), [21, 13, 3](p) respectively. Any transitive subgroup of automorphism groups of these graphs can be used for full permutation decoding using the corresponding codes. All the above codes can be used for full error correction by permutation decoding.
NSTL
Taylor & Francis
