Decoding Quasi-Cyclic codes is NP-complete.
Ernesto Dominguez FialloPablo Freyre ArrozarenaLuis Ramiro PiñeiroPublished in: IACR Cryptol. ePrint Arch. (2023)
Keyphrases
- np complete
- decoding algorithm
- error control
- ldpc codes
- parity check
- reed solomon
- joint source channel
- low density parity check
- decoding complexity
- error correcting
- np hard
- randomly generated
- error correction
- computational complexity
- satisfiability problem
- constraint satisfaction problems
- reed solomon codes
- error correcting codes
- conjunctive queries
- phase transition
- decoding process
- noise model
- coding scheme
- pspace complete
- turbo codes
- np complete problems
- bounded treewidth
- polynomial time complexity
- non binary
- branch and bound algorithm
- cnf formula
- error detection