A family of quantum codes with performances close to the hashing bound under iterative decoding.
Denise MauriceJean-Pierre TillichIryna AndriyanovaPublished in: ISIT (2013)
Keyphrases
- decoding algorithm
- parity check
- error control
- ldpc codes
- joint source channel
- error correcting
- low density parity check
- binary codes
- hashing methods
- reed solomon
- error correction
- quantum inspired
- worst case
- special case
- reed solomon codes
- lower bound
- upper bound
- quantum computing
- error correcting codes
- data structure
- turbo codes
- decoding complexity
- error bounds
- quantum computation
- similarity search
- hash functions
- random projections
- hash tables
- linear hashing
- nearest neighbor search