A practical algorithm for completing half-Hadamard matrices using LLL
DOI10.1007/S10801-021-01077-ZzbMATH Open1484.05032OpenAlexW3212678104MaRDI QIDQ2114786FDOQ2114786
Yossi Strassler, Assaf Goldberger
Publication date: 15 March 2022
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-021-01077-z
Cryptography (94A60) Matrices of integers (15B36) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Proceedings, conferences, collections, etc. pertaining to number theory (11-06) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- An existence theorem for latin squares
- Circulant partial Hadamard matrices
- Predicting Lattice Reduction
- An LLL Algorithm with Quadratic Complexity
- The LLL algorithm. Survey and applications
- A Fourier-analytic approach to counting partial Hadamard matrices
- Integral and rational completions of combinatorial matrices
- Counting results for thin Butson matrices
- Conjectures about 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
- Generating binary partial Hadamard matrices
Uses Software
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)
