The subfield and extended codes of a subclass of optimal three-weight cyclic codes
From MaRDI portal
Publication:6066777
DOI10.1007/s00453-023-01173-5MaRDI QIDQ6066777
Publication date: 13 December 2023
Published in: Algorithmica (Search for Journal in Brave)
Griesmer boundsecret sharing schemesoptimal linear codessphere-packing boundextended codessubfield codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- All two-weight irreducible cyclic codes?
- The subfield codes of hyperoval and conic codes
- A coding theory construction of new systematic authentication codes
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- An extended characterization of a class of optimal three-weight cyclic codes over any finite field
- New quantum codes from CSS codes
- Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- Sets of Optimal Frequency-Hopping Sequences
- The Geometry of Two-Weight Codes
- Fundamentals of Error-Correcting Codes
- Minimal vectors in linear codes
- On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions
- Two Families of Optimal Linear Codes and Their Subfield Codes
- The Subfield Codes of Ovoid Codes
- On the subfield codes of a subclass of optimal cyclic codes and their covering structures
- Projective Linear Codes From Some Almost Difference Sets
This page was built for publication: The subfield and extended codes of a subclass of optimal three-weight cyclic codes