Information sets and partial permutation decoding for codes from finite geometries

  title={Information sets and partial permutation decoding for codes from finite geometries},
  author={Jennifer D. Key and T. P. McDonough and Vassili C. Mavron},
  journal={Finite Fields and Their Applications},
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors for the codes of the designs of points and hyperplanes over prime fields. 

From This Paper

Figures, tables, and topics from this paper.
23 Citations
15 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 23 extracted citations


Publications referenced by this paper.
Showing 1-10 of 15 references

Permutation decoding of systematic codes

  • F. J. MacWilliams
  • Bell System Tech. J., 43:485–505
  • 1964
Highly Influential
4 Excerpts

Key . Bases of minimumweight vectors for codes from designs

  • D. J.
  • Finite Fields Appl .
  • 1998


  • E. F. Assmus, Jr, J. D. Key. Polynomial codes, finite geometries. In V.S. Pless, W. C. Huffman
  • Handbook of Coding Theory, pages 1269–1343…
  • 1998

Handbook of Magma Functions

  • J. Cannon.
  • 1994

University of Sydney

  • W. Bosma, J. Cannon. Handbook of Magma Functions. Deptartment o Mathematics
  • November
  • 1994
1 Excerpt

Designs and their Codes

  • E. F. Assmus, Jr, J. D. Key
  • Cambridge: Cambridge University Press,
  • 1992
1 Excerpt

Bruck nets

  • G. E. Moorhouse
  • codes, and characters of loops. Des. Codes…
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…