Quantum search algorithm for binary constant weight codes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 42384 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- A few new constant weight codes (Corresp.)
- A new construction of anticode-optimal Grassmannian codes
- A new table of constant weight codes
- A new table of constant weight codes of length greater than 28
- Design of balanced and constant weight codes for VLSI systems
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Grover's Quantum Algorithm Applied to Global Optimization
- Heuristic Algorithms for Constructing Binary Constant Weight Codes
- Implementing pure adaptive search with Grover's quantum algorithm
- Modelling constant weight codes using tabu search
- New constant weight codes from linear permutation groups
- Optical orthogonal codes: design, analysis and applications
- Orthogonal Frequency Division Multiplexing With Index Modulation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Reducibility among combinatorial problems
- Strengths and Weaknesses of Quantum Computing
- The theory of Newton's method
This page was built for publication: Quantum search algorithm for binary constant weight codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639960)
