Some constructions of (almost) optimally extendable linear codes
From MaRDI portal
Publication:6556583
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- A construction of q-ary linear codes with irreducible cyclic codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Complete weight enumerators of some linear codes and their applications
- Construction of some codes suitable for both side channel and fault injection attacks
- Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters
- Fundamentals of Error-Correcting Codes
- Infinite Families of Near MDS Codes Holding t-Designs
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- Minimal linear codes over finite fields
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Some (almost) optimally extendable linear codes
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- Weight enumerators of reducible cyclic codes and their dual codes
Cited in
(2)
This page was built for publication: Some constructions of (almost) optimally extendable linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556583)
