Construction of LCD-MRD codes of length n > N
From MaRDI portal
Publication:5866015
DOI10.1142/S1793830921501172OpenAlexW3135206598MaRDI QIDQ5866015
R. S. Raja Durai, Ashwini Kumar
Publication date: 10 June 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501172
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Complementary dual codes for counter-measures to side-channel attacks
- 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 the classification of linear complementary dual codes
- The combinatorics of LCD codes: linear programming bound and orthogonal matrices
- Hermitian LCD codes from cyclic codes
- Constructions of optimal LCD codes over large finite fields
- Some bounds on binary LCD codes
- Rank-metric complementary dual codes
- On self-dual and LCD double circulant and double negacirculant codes over \(\mathbb{F}_q+u\mathbb{F}_q \)
- Double circulant LCD codes over \(\mathbb{Z}_4\)
- Erasure Techniques in MRD codes
- On the Number of Self-Dual Bases of GF(q m ) Over GF(q)
- Reducible rank codes and their applications to cryptography
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
- Complementary Dual Algebraic Geometry Codes
- Error Detecting and Error Correcting Codes
- Some important results on 𝒯-Direct codes
- Universal Secure Network Coding via Rank-Metric Codes
- Reversible codes
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Construction of LCD-MRD codes of length n > N
