Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary Three-Error-Correcting-Codes

Deppe C (2000)
Discrete Math.: 79-98.

Journal Article | English

No fulltext has been uploaded

Publishing Year
PUB-ID

Cite this

Deppe C. Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary Three-Error-Correcting-Codes. Discrete Math. 2000:79-98.
Deppe, C. (2000). Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary Three-Error-Correcting-Codes. Discrete Math., 79-98.
Deppe, C. (2000). Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary Three-Error-Correcting-Codes. Discrete Math., 79-98.
Deppe, C., 2000. Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary Three-Error-Correcting-Codes. Discrete Math., , p 79-98.
C. Deppe, “Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary Three-Error-Correcting-Codes”, Discrete Math., 2000, pp. 79-98.
Deppe, C.: Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary Three-Error-Correcting-Codes. Discrete Math. 79-98 (2000).
Deppe, Christian. “Solution of Ulam's Searching Game with Three Lies or an Optimal Adaptive Strategy for Binary Three-Error-Correcting-Codes”. Discrete Math. (2000): 79-98.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar