The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes
From MaRDI portal
Publication:2179502
DOI10.1007/s12095-019-00362-wzbMath1446.94196OpenAlexW2925054460WikidataQ128186190 ScholiaQ128186190MaRDI QIDQ2179502
Publication date: 12 May 2020
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-019-00362-w
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items
Explicit factorization of xl1m1l2m2l3m3−a and a-constacyclic codes over a finite field ⋮ Several families of irreducible constacyclic and cyclic codes ⋮ Two classes of constacyclic codes with variable parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some cyclic codes of length \(2p^n\)
- The minimum Hamming distances of irreducible cyclic codes
- Idempotents in group algebras and minimal abelian codes
- On complementary-dual quasi-cyclic codes
- Linear codes with complementary duals
- Minimal codes of prime-power length.
- Minimal cyclic codes of length \(2p^n\)
- The condition for a cyclic code to have a complementary dual
- Minimal cyclic codes of length \(p^{n} q\).
- Galois LCD codes over finite fields
- The primitive idempotents and weight distributions of irreducible constacyclic codes
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- Constacyclic Codes and Some New Quantum MDS Codes
- Complementary Dual Codes for Counter-Measures to Side-Channel Attacks
- Explicit evaluations of some Weil sums
- Fundamentals of Error-Correcting Codes
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction
- New Characterization and Parametrization of LCD Codes
- Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes
- Codes for Symbol-Pair Read Channels
- LCD Cyclic Codes Over Finite Fields
- A class of minimal cyclic codes over finite fields
