Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs.

Fernando Granha Jeronimo

Published in: APPROX/RANDOM (2023)

Keyphrases

decoding algorithm
constraint satisfaction problems
closed form
constraint satisfaction
dynamic programming
worst case
approximation algorithms
optimal solution
error correcting
reed solomon
error correction
parity check
reed solomon codes
ldpc codes
error tolerance
approximation schemes
error bounds
special case