Optimal constacyclic codes with minimum distance four
From MaRDI portal
Cites work
- A q-polynomial approach to constacyclic codes
- A class of optimal ternary cyclic codes and their duals
- A class of three-weight cyclic codes
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Cyclic Codes and Sequences From Generalized Coulter–Matthews Function
- Fundamentals of Error-Correcting Codes
- Further results on optimal ternary cyclic codes
- LCD Cyclic Codes Over Finite Fields
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- New classes of optimal ternary cyclic codes with minimum distance four
- On an open problem about a class of optimal ternary cyclic codes
- On some conjectures about optimal ternary cyclic codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On the minimum distance of negacyclic codes with two zeros
- Optimal Ternary Cyclic Codes From Monomials
- Optimal p-ary cyclic codes with minimum distance four from monomials
- Optimal ternary cyclic codes with minimum distance four and five
- Several classes of optimal ternary cyclic codes with minimal distance four
- The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials
- Two classes of new optimal ternary cyclic codes
- Two families of optimal ternary cyclic codes with minimal distance four
This page was built for publication: Optimal constacyclic codes with minimum distance four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938580)