Binary and ternary LCD codes from projective spaces

DOI10.1142/S1793830918500799zbMath1405.94114MaRDI QIDQ4644790

Lauren Melcher, Pani Seneviratne

Publication date: 9 January 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

Griesmer boundLCD codesfew-weight codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Applications of graph theory to circuits and networks (94C15)

Uses Software

• Magma
• Code Tables

Cites Work

• Unnamed Item
• Complementary dual codes for counter-measures to side-channel attacks
• On complementary-dual quasi-cyclic codes
• Linear codes with complementary duals
• The condition for a cyclic code to have a complementary dual
• The Magma algebra system. I: The user language
• \(LCD\) codes from adjacency matrices of graphs
• The combinatorics of LCD codes: linear programming bound and orthogonal matrices
• A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
• Linear codes with complementary duals meet the Gilbert-Varshamov bound
• LCD codes over finite chain rings
• Design Methods for Maximum Minimum-Distance Error-Correcting Codes
• The Geometry of Two-Weight Codes
• Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)
• Algebraically punctured cyclic codes