New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels.
Arkady G. D'yachkovD. Yu. GoshkoderPublished in: Probl. Inf. Transm. (2021)
Keyphrases
- communication channels
- lower bound
- upper bound
- error correcting
- branch and bound
- error detection
- objective function
- branch and bound algorithm
- np hard
- worst case
- decoding algorithm
- lower bounding
- optimal solution
- linked list
- vc dimension
- expected error
- online algorithms
- query processing
- upper and lower bounds
- lower and upper bounds
- error analysis
- error bounds
- decoding process
- randomly generated problems
- set of randomly generated instances