Correcting a single error in feedback channels
From MaRDI portal
Publication:6173470
DOI10.1134/s0032946022040044OpenAlexW4315563004MaRDI QIDQ6173470
No author found.
Publication date: 21 July 2023
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946022040044
Linear programming (90C05) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Ulam's searching game with two lies
- Solution of Ulam's problem on searching with a lie
- Coping with errors in binary search procedures
- The halflie problem.
- Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
- A halfliar's game
- Nonbinary error-correcting codes with one-time error-free feedback
- New upper bounds on the size of codes correcting asymmetric errors (Corresp.)
- Upper bounds on codes correcting asymmetric errors (Corresp.)
- Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
- The Two-Batch Liar Game over an Arbitrary Channel
This page was built for publication: Correcting a single error in feedback channels