A practical algorithm for completing half-Hadamard matrices using LLL
From MaRDI portal
Publication:2114786
Recommendations
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3582307 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 2009972 (Why is no real title available?)
- scientific article; zbMATH DE number 5486283 (Why is no real title available?)
- A Fourier-analytic approach to counting partial Hadamard matrices
- A counterexample to Beder's conjectures about Hadamard matrices
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- An LLL algorithm with quadratic complexity
- An existence theorem for latin squares
- Circulant partial Hadamard matrices
- Conjectures about Hadamard matrices
- Counting results for thin Butson matrices
- Factoring polynomials with rational coefficients
- Generating binary partial Hadamard matrices
- Integral and rational completions of combinatorial matrices
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Predicting Lattice Reduction
- The LLL algorithm. Survey and applications
This page was built for publication: A practical algorithm for completing half-Hadamard matrices using LLL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114786)