Construction of binary and ternary self-orthogonal linear codes

DOI10.1016/j.dam.2007.10.030zbMath1167.94005OpenAlexW2004745760MaRDI QIDQ1026113

Alfred Wassermann, Axel Kohnert

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.10.030

zbMATH Keywords

incidence matrixlattice point enumerationgroup of automorphismself-orthogonal linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Automorphisms of abstract finite groups (20D45) Relations with coding theory (11H71)

Related Items (2)

On linear codes admitting large automorphism groups ⋮ On the existence of PD-sets: algorithms arising from automorphism groups of codes

Cites Work

• Attacking the market split problem with lattice point enumeration
• Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
• Construction of Linear Codes With Large Minimum Distance
• Optimal Linear Codes From Matrix Groups
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of binary and ternary self-orthogonal linear codes