LCD codes and almost optimally extendable codes from self-orthogonal codes
From MaRDI portal
Publication:6618618
DOI10.1007/s10623-024-01420-yMaRDI QIDQ6618618
Ziling Heng, Fengwei Li, Qin Yue, Xinran Wang
Publication date: 14 October 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complementary dual codes for counter-measures to side-channel attacks
- Linear codes with complementary duals
- A characteristic property of self-orthogonal codes and its application to lattices
- The condition for a cyclic code to have a complementary dual
- Construction of some codes suitable for both side channel and fault injection attacks
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
- Combinatorial \(t\)-designs from special functions
- Binary primitive LCD BCH codes
- Some (almost) optimally extendable linear codes
- Linear Codes From Some 2-Designs
- Complementary Dual Codes for Counter-Measures to Side-Channel Attacks
- Fundamentals of Error-Correcting Codes
- Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction
- New LCD MDS Codes of Non-Reed-Solomon Type
- Designs from Linear Codes
- Two Families of Optimal Linear Codes and Their Subfield Codes
- Bent Functions
- LCD Cyclic Codes Over Finite Fields
- Ternary primitive LCD BCH codes
- Some constructions of (almost) optimally extendable linear codes
- On binary LCD BCH codes of length \(\frac{2^m + 1}{3}\)
This page was built for publication: LCD codes and almost optimally extendable codes from self-orthogonal codes
