Partial permutation decoding for MacDonald codes
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Design Methods for Maximum Minimum-Distance Error-Correcting Codes
- Greedy codes
- Information sets and partial permutation decoding for codes from finite geometries
- Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On coverings
- On the construction of linear \(q\)-ary lexicodes.
- PD-sets for the codes related to some classical varieties
- Partial permutation decoding for codes from finite planes
- Partial permutation decoding for simplex codes
- Permutation Decoding of Systematic Codes
- The Magma algebra system. I: The user language
Cited in
(4)
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)