On the maximum-likelihood decoding problem
From MaRDI portal
Cites work
- A complexity theory for feasible closure properties
- Breaking Goppa-based McEliece with hints
- Complexity of generalized satisfiability counting problems
- Computational Complexity of Probabilistic Turing Machines
- Convolutional neural network based decoders for surface codes
- Cryptography and Coding
- Hardness of approximating the minimum distance of a linear code
- Hardness of Decoding Quantum Stabilizer Codes
- scientific article; zbMATH DE number 5076264 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1390075 (Why is no real title available?)
- Inter-generational comparison of quantum annealers in solving hard scheduling problems
- Lattice problems beyond polynomial time
- MAJORITY-3SAT (and related problems) in polynomial time
- Neural networks, error-correcting codes, and polynomials over the binary n-cube
- On the design and security of Lee metric McEliece cryptosystems
- On the hardnesses of several quantum decoding problems
- On the inherent intractability of certain coding problems (Corresp.)
- On the power of counting the total number of computation paths of NPTMs
- On unique graph 3-colorability and parsimonious reductions in the plane
- Parameterized problems related to Seidel's switching
- Phase transitions of PP-complete satisfiability problems
- Quantum and classical complexity classes: Separations, collapses, and closure properties
- Quantum Complexity Theory
- Quantum Computability
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computing, postselection, and probabilistic polynomial-time
- Quantum McEliece public-key cryptosystem
- Reducibility among combinatorial problems
- Reinforcement learning for optimal error correction of toric codes
- Secure integration of asymmetric and symmetric encryption schemes
- Some new NP-complete coding problems
- Some simplified NP-complete graph problems
- The complexity of computing the permanent
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- The hardness of decoding linear codes with preprocessing
- The intractability of computing the minimum distance of a code
- Towards non-black-box lower bounds in cryptography
This page was built for publication: On the maximum-likelihood decoding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855553)
