Computer classification of linear codes based on lattice point enumeration

DOI10.1007/978-3-031-64529-7_11MaRDI QIDQ6637797zbMATH OpenFDO

Authors Sascha Kurz

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-64529-7_11

zbMATH Keywords

classificationenumerationinteger linear programminglattice-point enumerationlinear codestwo-weight codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites work

• Attacking the market split problem with lattice point enumeration
• Classification algorithms for codes and designs
• Classifying subspaces of Hamming spaces
• Codes and projective multisets
• Computer Classification of Linear Codes
• Divisibility of codes meeting the Griesmer bound
• Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
• scientific article; zbMATH DE number 3532973 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• Lattice based extended formulations for integer linear equality systems
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Optimal binary linear codes of length \(\leq 30\)
• Small additive quaternary codes.
• Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
• Some quaternary additive codes outperform linear counterparts
• The Geometry of Two-Weight Codes
• Two-weight codes

This page was built for publication: Computer classification of linear codes based on lattice point enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637797)