Partial permutation decoding for codes from finite planes
Authors:
- J.D. KeyJKJ.D. Key
- T.P. McDonoughTMT.P. McDonough
- V.C. MavronVMV.C. Mavron
- 1 July 2005
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 26 (5) , 665-682
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Permutation decoding for the binary codes from triangular graphsEuropean Journal of Combinatorics, 2003
- Dual Codes of Translation PlanesEuropean Journal of Combinatorics, 2002
- Minimum Weight and Dimension Formulas for Some Geometric CodesDesigns, Codes and Cryptography, 1999
- Some p-Ranks Related to Orthogonal SpacesJournal of Algebraic Combinatorics, 1995
- Bruck nets, codes, and characters of loopsDesigns, Codes and Cryptography, 1991
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)IEEE Transactions on Information Theory, 1982
- On coveringsPacific Journal of Mathematics, 1964
- Permutation Decoding of Systematic CodesBell System Technical Journal, 1964