Achieving PAC Code Performance with SCL Decoding without Extra Computational Complexity.
Samet GelincikPhilippe MaryJean-Yves BaudaisAnne SavardPublished in: ICC (2022)
Keyphrases
- computational complexity
- error correcting
- reed solomon
- error control
- source code
- special case
- ldpc codes
- decoding algorithm
- low density parity check
- sample complexity
- error correction
- storage requirements
- pac learning
- high computational complexity
- np complete
- memory requirements
- noise tolerant
- upper bound
- sample size
- open source
- np hard
- low complexity
- computational cost
- decision trees