Partial permutation decoding for MacDonald codes
From MaRDI portal
Publication:503553
DOI10.1007/S00200-016-0286-7zbMATH Open1353.05027OpenAlexW2301865936MaRDI QIDQ503553FDOQ503553
Authors: J. D. Key, Padmapani Seneviratne 
Publication date: 13 January 2017
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-016-0286-7
Recommendations
- Partial permutation decoding for codes from finite planes
- Partial permutation decoding for codes from affine geometry designs
- \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\)
- Improved partial permutation decoding for Reed-Muller codes
- Partial permutation decoding for simplex codes
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Decoding (94B35)
Cites Work
- The Magma algebra system. I: The user language
- On the construction of linear \(q\)-ary lexicodes.
- Title not available (Why is that?)
- Title not available (Why is that?)
- PD-sets for the codes related to some classical varieties
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Partial permutation decoding for simplex codes
- Title not available (Why is that?)
- Permutation Decoding of Systematic Codes
- Partial permutation decoding for codes from finite planes
- On coverings
- Information sets and partial permutation decoding for codes from finite geometries
- Design Methods for Maximum Minimum-Distance Error-Correcting Codes
- Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)
- Greedy codes
Cited In (2)
Uses Software
This page was built for publication: Partial permutation decoding for MacDonald codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503553)
