LCD codes over finite fields
From MaRDI portal
Cites work
- \(LCD\) codes from adjacency matrices of graphs
- Complementary dual codes for counter-measures to side-channel attacks
- Construction of self dual codes from graphs
- Design Methods for Maximum Minimum-Distance Error-Correcting Codes
- Dimension and minimum distance of a class of \(BCH\) codes
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256780 (Why is no real title available?)
- Infinite Families of Near MDS Codes Holding t-Designs
- Isometries for rank distance and permutation group of gabidulin codes
- Linear codes from vectorial Boolean functions in the context of algebraic attacks
- Linear codes with complementary duals
- New Characterization and Parametrization of LCD Codes
- On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences
- On the automorphism groups of affine-invariant codes
- On the Number of Self-Dual Bases of GF(q m ) Over GF(q)
- Optimal binary LCD codes
- Rank-metric complementary dual codes
- Some new constructions of isodual and LCD codes over finite fields
- The condition for a cyclic code to have a complementary dual
Cited in
(2)
This page was built for publication: LCD codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6922510)
