Partial permutation decoding for codes from finite planes

Authors:
J. D. Key;T. P. McDonough;V. C. Mavron
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC;Department of Mathematics, University of Wales, Aberystwyth, Ceredigion, SY23 3BZ, UK;Department of Mathematics, University of Wales, Aberystwyth, Ceredigion, SY23 3BZ, UK
Venue:
European Journal of Combinatorics
Year:
2005

Citing 6
Cited 6

Bruck nets, codes, and characters of loops

Designs, Codes and Cryptography
Designs and their codes

Designs and their codes
Some p-Ranks Related to Orthogonal Spaces

Journal of Algebraic Combinatorics: An International Journal
Minimum Weight and Dimension Formulas for Some GeometricCodes

Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Dual codes of translation planes

European Journal of Combinatorics
Permutation decoding for the binary codes from triangular graphs

European Journal of Combinatorics

Binary codes from rectangular lattice graphs and permutation decoding

European Journal of Combinatorics
Binary codes from the line graph of the n-cube

Journal of Symbolic Computation
Codes from lattice and related graphs, and permutation decoding

Discrete Applied Mathematics
Information sets and partial permutation decoding for codes from finite geometries

Finite Fields and Their Applications
Information sets in abelian codes: defining sets and Groebner basis

Designs, Codes and Cryptography
Hulls of codes from incidence matrices of connected regular graphs

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.