List decoding bounds for binary codes with noiseless feedback
From MaRDI portal
Cites work
- Algorithmic Results in List Decoding
- Binary Error-Correcting Codes with Minimal Noiseless Feedback
- Coding for interactive communication: a survey
- Combinatorial Limitations of Average-Radius List-Decoding
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Generic Reed-Solomon codes achieve list-decoding capacity
- scientific article; zbMATH DE number 1003301 (Why is no real title available?)
- scientific article; zbMATH DE number 3970683 (Why is no real title available?)
- scientific article; zbMATH DE number 3205803 (Why is no real title available?)
- scientific article; zbMATH DE number 3282350 (Why is no real title available?)
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Randomly punctured Reed-Solomon codes achieve the list decoding capacity over polynomial-size alphabets
- Searching games with errors -- fifty years of coping with liars
- Solution of Ulam's problem on searching with a lie
- Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
- Three Thresholds for a Liar
- Two Batch Search With Lie Cost
- Ulam's searching game with two lies
- Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery
This page was built for publication: List decoding bounds for binary codes with noiseless feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296704)
