Error-correcting codes with feedback

This is an old revision of this page, as edited by Geometry guy (talk | contribs) at 09:11, 5 December 2007 (Add the obvious reference). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, computer science, telecommunication, information theory, and searching theory, error-correcting codes with noiseless feedback has great practical importance. An error correcting code with noiseless feedback is equivalent to an adaptive searching strategy with errors.

In 1956 Claude Shannon introduced the discrete memoryless channel with noiseless feedback. In 1961 Alfréd Rényi introduced the Bar-Kochba game with a given percentage of wrong answers. In 1964 Elwyn Berlekamp considered in his dissertation error correcting codes with noiseless feedback.[1]

References

  1. ^ Christian Deppe (2007), "Coding with Feedback and Searching with Lies", in Imre Csiszár, Gyula O.H. Katona, and Gabor Tardos (ed.), Entropy, Search, Complexity, Bolyai Society Mathematical Studies, vol. 16, Berlin-Heidelberg: Springer, pp. 27–70, doi:10.1007/978-3-540-32777-6, ISBN 978-3-540-32573-4, ISSN 1217-4696{{citation}}: CS1 maint: multiple names: editors list (link)