Revision as of 21:03, 16 December 2007 edit Ra2007 (talk \| contribs) 854 edits tagging for this: "In 1964 Elwyn Berlekamp considered in his dissertation error correcting codes with noiseless feedback" ← Previous edit		Revision as of 21:04, 16 December 2007 edit undo Ra2007 (talk \| contribs) 854 edits Sources above references Next edit →
Line 12: Berlekamp's approach was to have the receiver choose a subset of possible messages and ask the sender whether the given message was in this subset, a yes/no answer. Based on this answer the receiver then chooses a new subset and the process is repeated. The game is further complicated as due to noise that some of the answers will be wrong. ==~~Notes~~Sources== {{reflist}}▼ ==References==▼ * {{citation\|first=Christian\|last=Deppe\|chapter=Coding with Feedback and Searching with Lies\|series=Bolyai Society Mathematical Studies\|issn=1217-4696\| volume = 16\|editor=Imre Csiszár, Gyula O.H. Katona, and Gabor Tardos\|title=Entropy, Search, Complexity\|publisher=Springer\|place=Berlin-Heidelberg\|doi=10.1007/978-3-540-32777-6\|year=2007\|isbn=978-3-540-32573-4\|pages=27-70}}. * {{citation\|first=Ray\|last=Hill\|title=Searching with lies\|series=Cambridge London Mathematical Society Lecture Note Series, Surveys in Combinatorics\|pages=41-70\|year=1995\|isbn=0-521-49797-3}}. ▲==References== ▲{{reflist}} ==See also==

Error-correcting codes with feedback: Difference between revisions