Computer classification of linear codes based on lattice point enumeration
From MaRDI portal
Publication:6637797
DOI10.1007/978-3-031-64529-7_11MaRDI QIDQ6637797
Publication date: 13 November 2024
classificationtwo-weight codeslinear codesenumerationinteger linear programminglattice-point enumeration
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Attacking the market split problem with lattice point enumeration
- Classification algorithms for codes and designs
- Lattice based extended formulations for integer linear equality systems
- Codes and projective multisets
- Divisibility of codes meeting the Griesmer bound
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Small additive quaternary codes.
- Optimal binary linear codes of length \(\leq 30\)
- Classifying subspaces of Hamming spaces
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
- The Geometry of Two-Weight Codes
- Computer Classification of Linear Codes
- Some quaternary additive codes outperform linear counterparts
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)
