Search for combinatorial objects using lattice algorithms -- revisited

DOI10.1007/978-3-030-79987-8_2OpenAlexW3174800294MaRDI QIDQ2115837

Alfred Wassermann

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_2

zbMATH Keywords

combinatorial searchlattice enumeration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Higher incidence matrices and tactical decomposition matrices ⋮ On the classification of unitals on 28 points of low rank

Uses Software

• CPLEX
• Gurobi
• Cliquer
• DISCRETA
• YIELDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large sets of subspace designs
• Attacking the market split problem with lattice point enumeration
• Classification algorithms for codes and designs
• Constructing two-weight codes with prescribed groups of automorphisms
• The LLL algorithm. Survey and applications
• A hierarchy of polynomial time lattice basis reduction algorithms
• The existence of simple \(6\text{-}(14,7,4)\) designs
• Factoring polynomials with rational coefficients
• Improved low-density subset sum algorithms
• t-designs on hypergraphs
• Simple \(8\)-designs with small parameters
• Graphical \(t\)-designs via polynomial Kramer-Mesner matrices
• New \(t\)-designs and large sets of \(t\)-designs
• A new series of large sets of subspace designs over the binary field
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• New results on codes with covering radius 1 and minimum distance \(2\)
• Large sets of \(t\)-designs over finite fields
• Construction of \((n, r)\)-arcs in \(PG(2, q)\)
• New Upper Bounds on Binary Linear Codes and a $ {\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• 2. q-analogs of group divisible designs
• New large sets oft-designs with prescribed groups of automorphisms
• Optimal Linear Codes From Matrix Groups
• YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
• Solving low-density subset sum problems
• Minkowski's Convex Body Theorem and Integer Programming
• An Improved Low-Density Subset Sum Algorithm
• How to Calculate Shortest Vectors in a Lattice
• New Small 4-Designs with Nonabelian Automorphism Groups
• Some new designs with prescribed automorphism groups
• Fourier Analysis of Uniform Random Number Generators

This page was built for publication: Search for combinatorial objects using lattice algorithms -- revisited