A note on good permutation codes from Reed-Solomon codes
From MaRDI portal
Publication:2324769
Recommendations
Cites work
- A Class of Error-Correcting Codes in p^m Symbols
- A direct proof for the automorphism group of reed solomon codes
- A new table of permutation codes
- An application of permutatation arrays to block ciphers
- An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
- Bounds for permutation arrays
- Constructing permutation arrays from groups
- Constructions for permutation codes in powerline communications
- Decoding of Reed Solomon codes beyond the error-correction bound
- Extending permutation arrays: improving MOLS bounds
- Handbook of finite fields
- scientific article; zbMATH DE number 3135133 (Why is no real title available?)
- On the maximum number of permutations with given maximal or minimal distance
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Permutation codes invariant under isometries
- Permutation polynomials and orthomorphism polynomials of degree six
- Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2
- Polynomial Codes Over Certain Finite Fields
- Shift-register synthesis and BCH decoding
- The automorphism groups of Reed-Solomon codes
- When Does a Polynomial Over a Finite Field Permute the Elements of the Field?
- When Does a Polynomial over a Finite Field Permute the Elements of the Field?, II
Cited in
(3)
This page was built for publication: A note on good permutation codes from Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324769)