On the Construction of Binary Optimal LCD Codes with Short Length

DOI10.1142/S0129054119500242zbMath1427.94091OpenAlexW2997633236WikidataQ126564747 ScholiaQ126564747MaRDI QIDQ5207033

No author found.

Publication date: 19 December 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054119500242

zbMATH Keywords

minimum distancelinear complementary dualbinary optimal code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (5)

Characterization and classification of optimal LCD codes ⋮ An improved method for constructing formally self-dual codes with small hulls ⋮ Constructions of symplectic LCD MDS codes from quasi-cyclic codes ⋮ Optimal quaternary Hermitian LCD codes and their related codes ⋮ Construction of binary LCD codes, ternary LCD codes and quaternary Hermitian LCD codes

Cites Work

• Linear codes with complementary duals
• The \([18,9,6\) code is unique]
• The condition for a cyclic code to have a complementary dual
• The combinatorics of LCD codes: linear programming bound and orthogonal matrices
• Some bounds on binary LCD codes
• The joint weight enumerator of an LCD code and its dual
• Linear codes with complementary duals meet the Gilbert-Varshamov bound
• On the binary projective codes with dimension 6
• Design Methods for Maximum Minimum-Distance Error-Correcting Codes
• Complementary Dual Codes for Counter-Measures to Side-Channel Attacks
• On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
• Fundamentals of Error-Correcting Codes

This page was built for publication: On the Construction of Binary Optimal LCD Codes with Short Length