A construction of \(q\)-ary linear codes with irreducible cyclic codes
From MaRDI portal
Publication:2414935
DOI10.1007/s10623-018-0507-0zbMath1439.11294OpenAlexW2808199594WikidataQ129656387 ScholiaQ129656387MaRDI QIDQ2414935
Publication date: 17 May 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0507-0
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear codes with two or three weights from quadratic bent functions
- A construction of codes with linearity from two linear codes
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Constacyclic codes over finite fields
- Hamming weights in irreducible cyclic codes
- On self-dual constacyclic codes over finite fields
- A construction of linear codes and their complete weight enumerators
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- Cyclotomic Linear Codes of Order $3$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- The Geometry of Two-Weight Codes
- A characterization of codes meeting the Griesmer bound
- Fundamentals of Error-Correcting Codes
- A note on evaluations of some exponential sums
- Two New Families of Two-Weight Codes
- Minimal vectors in linear codes
- A Bound for Error-Correcting Codes
This page was built for publication: A construction of \(q\)-ary linear codes with irreducible cyclic codes
