Coding with noiseless feedback
From MaRDI portal
Recommendations
- Algorithms for q-ary error-correcting codes with limited magnitude and feedback
- Ulam-Rényi problem on searching with errors and optimal error-correcting codes
- scientific article; zbMATH DE number 512984
- An algorithm for ``Ulam's Game and its application to error correcting codes
- scientific article; zbMATH DE number 2091981
Cites work
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- scientific article; zbMATH DE number 3547240 (Why is no real title available?)
- scientific article; zbMATH DE number 3566730 (Why is no real title available?)
- scientific article; zbMATH DE number 3598475 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- scientific article; zbMATH DE number 3205803 (Why is no real title available?)
- scientific article; zbMATH DE number 3400776 (Why is no real title available?)
- Nonbinary error-correcting codes with one-time error-free feedback
- On error correction with errors in both the channel and syndrome
- Searching with lies
- 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
Cited in
(8)- Feedback insertion-deletion codes
- Search for a moving element with the minimum total cardinality of tests
- Algorithms for q-ary error-correcting codes with limited magnitude and feedback
- Bounds for the capacity error function for unidirectional channels with noiseless feedback
- A progressive universal noiseless coder
- Recent developments of feedback coding and its relations with many-valued logic
- Ulam-Rényi games, MV-algebras, Specker -groups
- Twenty questions with random error
This page was built for publication: Coding with noiseless feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364460)
