论文信息 - Partial permutation decoding for codes from finite planes

Partial permutation decoding for codes from finite planes

We determine to what extent permutation decoding can be used for the codes from desarguesian projective and affine planes. We define the notion of s-PD-sets to correct s errors, and construct some specific small sets for s = 2 and 3 for desarguesian planes of prime order.

Jennifer D. Key | Vassili C. Mavron | T. P. McDonough

[1] K. Brown,et al. Graduate Texts in Mathematics , 1982 .

[2] Rita Procesi,et al. Codes and groups , 2006 .

[3] J. Macwilliams. Permutation decoding of systematic codes , 1964 .

[4] Daniel M. Gordon. Minimal permutation sets for decoding the binary Golay codes , 1982, IEEE Trans. Inf. Theory.

[5] G. Eric Moorhouse. Bruck nets, codes, and characters of loops , 1991, Des. Codes Cryptogr..

[6] Marialuisa J. de Resmini,et al. Minimum Weight and Dimension Formulas for Some Geometric Codes , 1999, Des. Codes Cryptogr..

[7] Marialuisa J. de Resmini,et al. Dual Codes of Translation Planes , 2002, Eur. J. Comb..

[8] Jamshid Moori,et al. Permutation decoding for the binary codes from triangular graphs , 2004, Eur. J. Comb..

[9] A. Blokhuis,et al. Some p-Ranks Related to Orthogonal Spaces , 1995 .

[10] Jennifer D. Key,et al. Designs and their codes , 1992, Cambridge tracts in mathematics.

[11] K. L. Clark. Geometric Codes over Fields of Odd Prime Power Order , 2003 .

[12] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .