Rank-metric complementary dual codes
From MaRDI portal
Publication:2008057
DOI10.1007/s12190-019-01254-1zbMath1427.94096OpenAlexW2937133663WikidataQ128189549 ScholiaQ128189549MaRDI QIDQ2008057
Publication date: 22 November 2019
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-019-01254-1
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items
Multiple-rate error-correcting coding scheme ⋮ Further results on LCD generalized Gabidulin codes ⋮ Application of \(\mathcal{T}\)-direct codes in multiple-rate codes ⋮ Some important results on 𝒯-Direct codes ⋮ Construction of LCD-MRD codes of length n > N
Cites Work
- Unnamed Item
- Unnamed Item
- Complementary dual codes for counter-measures to side-channel attacks
- Rank-metric codes and their duality theory
- On complementary-dual quasi-cyclic codes
- Theory of codes with maximum rank distance
- Linear codes with complementary duals
- Bilinear forms over a finite field, with applications to coding theory
- The condition for a cyclic code to have a complementary dual
- On group codes with complementary duals
- The combinatorics of LCD codes: linear programming bound and orthogonal matrices
- Galois LCD codes over finite fields
- Constructions of good entanglement-assisted quantum error correcting codes
- Euclidean and Hermitian LCD MDS codes
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- LCD codes over finite chain rings
- Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound
- On the Number of Self-Dual Bases of GF(q m ) Over GF(q)
- Coding for Errors and Erasures in Random Network Coding
- Complementary Dual Algebraic Geometry Codes
- New Constructions of MDS Codes With Complementary Duals
- On Metrics for Error Correction in Network Coding
- Universal Secure Network Coding via Rank-Metric Codes
- LCD Cyclic Codes Over Finite Fields
