Abstract
The basic problem of feedback coding is vividly described by Rényi [23, p. 47] as a problem of fault-tolerant adaptive search with errors, as follows: […] I made up the following version, which I called “Bar-kochba with lies”. Assume that the number of questions which can be asked to figure out the “something” being thought of is fixed and the one who answers is allowed to lie a certain number of times. The questioner, of course, doesn’t know which answer is true and which is not. Moreover the one answering is not required to lie as many times as is allowed. For example, when only two things can be thought of and only one lie is allowed, then 3 questions are needed […] If there are four things to choose from and one lie is allowed, then five questions are needed. If two or more lies are allowed, then the calculation of the minimum number of questions is quite complicated […] It does seem to be a very profound problem […]
* The first author was supported by the Sofja Kovaleskvaja Award of the Alexander von Humboldt Foundation. The second author was partially supported by Cofin-2004 Project on Manyvalued Logic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The reader may provide the necessary reformulation of “answer” for the cooperative model where Carole knows Paul’s searching strategy.
- 2.
Here \(\dot -\) denotes subtraction truncated to 0.
- 3.
The dependence of the S i ’s on b is understood.
- 4.
This latter paper gives the state of the art on the asymmetric Rényi-Ulam game.
- 5.
Note the asymmetric effect of noise.
- 6.
- 7.
Definition 8.1 is a generalization of the present one, but only applies to the symmetric channel.
- 8.
Since search on a symmetric channel is harder than on the Z-channel, a fortiori Paul can successfully use Gilbert packing for this part of his strategy on the asymmetric channel.
- 9.
Of course, answers sent on channel j may still contain relevant information about any \(w\not=z.\) In accordance with our aims in this section, we shall not be interested in defining the various types of optimization problems concerning search in a multichannel game: suffice to say that communication on a noisy channel is cheaper than on a low-noise channel. Thus Paul’s minimum cost search of x secret will require a careful analysis of which channels should be used when: generally speaking, an expensive channel is to be sparingly used, after the search space has been greatly reduced by preliminary extensive use of noisy channels.
- 10.
In the co-operative model where Carole knows Paul’s strategy and errors are due to distortion, Carole sends honest bits \(b=0,1\) to signify her negative or positive answers. It is expected that up to e j of these answers may be erroneous/mendacious.
- 11.
Even if Carole’s answers sent on a noisy channel \(d>1\) may suggest that z is not a possible candidate for x secret , Carole’s further answers on a more reliable channel \(d'<d\) may well have the contrary effect. When this happens we are led to revise the error parameter e d , or to conclude that an exceptionally large number of errors has affected channel d during this particular session. The essential role of each e d is to tentatively fix an upper bound for our counting of distorted bits sent through channel d: thus, \(e_{d}+1, e_{d}+2,\ldots\) wrong bits are counted as e d . While it is true that only the first channel can give a definitive verdict about which x’s should be excluded as possible candidates for x secret , also the other (less expensive) channels are useful in the search of x secret : in most concrete applications they can be used to substantially reduce the size of the search space.
- 12.
This is a generalization of the notion of state given in the first part of this paper.
- 13.
Compare with [5, p. 247].
- 14.
For any linearly ordered BL-algebra A, the Wajsberg hoops W i such that \(A\cong \bigoplus W_{i}\) will be called the Wajsberg components of A.
- 15.
In fact also the converse is true.
References
Aglianó P., Ferreirim I. M. A., and Montagna F. Basic hoops: an algebraic study of continuous t-norms, Preprint.
Aglianó P., and Montagna F. Varieties of BL-algebras I: general properties, J. Pure Appl. Algebra, 181: 105–129, 2003.
Ahlswede R., Cicalese F., and Deppe C. Searching with lies under error cost constraints. Submitted, 2004.
Berlekamp E. R. Block coding for the binary symmetric channel with noiseless, delayless feedback. In H. B. Mann, editor, Error-Correcting Codes, pages 330–335. Wiley, New York, NY, 1968.
Blok W. J., and Ferreirim I. M. A. On the structure of hoops, Algebra Universalis, 43: 233–257, 2000.
Cicalese F., and Mundici D. Perfect two fault-tolerant search with minimum adaptiveness, Adv. Appl. Math., 25: 65–101, 2000.
Cicalese F., and Mundici D. Optimal coding with one asymmetric error: below the sphere packing bound, Lecture Notes in Computer Science, Proceedings COCOON-2000, Springer, 1858: 159–169, 2000.
Cicalese F., and Mundici D. Learning and the art of fault-tolerant guesswork. In I. Stamatescu et al., editors, Handbook Chapter, In: Perspectives on Adaptivity and Learning, pages 117–143. Springer, 2003.
Cicalese F., Mundici D., and Vaccaro U. Rota-Metropolis cubic logic and Ulam-Rényi games. In H. Crapo, and D. Senato, editors. Algebraic Combinatorics and Computer Science: A Tribute to Gian-Carlo Rota, pages 197–244. Springer, Milan, 2001.
Cicalese F., Mundici D., and Vaccaro U. Least adaptive optimal search with unreliable tests, Theor. Comput. Sci., 270: 877–893, 2002.
Cignoli R., D’Ottaviano I. M. L., and Mundici D. Algebraic Foundations of Many-Valued Reasoning. Kluwer, Dordrecht, 2000.
Dumitriu I., and Spencer J. The Liar Game over an Arbitrary Channel, Theor. Comput. Sci., 2004, to appear.
Gottwald S. A treatise on Many-Valued logics (Studies in Logic and Computation, vol. 9). Research Studies Press, Baldock, 2000.
Hájek P. Metamathematics of Fuzzy logic. Kluwer, Dordrecht, 1998.
Klawonn F., and Kruse R. A Łukasiewicz logic based Prolog, Math. Soft Comput., 1: 5–29, 1994.
Laskowski L. C., and Shashoua Y. V. A classification of BL-algebras, Fuzzy Sets Syst., 131: 271–282, 2002.
MacWilliams F. J., and Sloane N. J. A. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.
Mundici D. The logic of Ulam’s game with lies. In C. Bicchieri, and M. L. Dalla Chiara, editors, Knowledge, Belief and Strategic Interaction, pages 275–284. Cambridge University Press, Cambridge, 1992. (Cambridge Studies in Probability, Induction and Decision Theory).
Mundici D. Ulam’s games, Łukasiewicz logic, and AF C_-algebras, Fund. Inform., 18: 151–161, 1993.
Mundici D. Ulam game, the logic of Maxsat, and many-valued partitions, In D. Dubois, H. Prade, E.P. Klement, editors, Logics and Reasoning About Knowledge, pages 121–137. Kluwer Academic Publishers, Dordrecht, 1999.
Pelc A. Searching games with errors: fifty years of coping with liars, Theor. Comput. Sci., 270: 71–109, 2002.
Pierce J.R. Optical Channels: Practical limits with photon counting, IEEE Trans. Comm., COM-26: 1819–1821, 1978.
Rènyi A., Napló az információelméletről, Gondolat, Budapest, 1976. (English translation: A Diary on Information Theory, J. Wiley and Sons, New York, 1984).
Tietäväinen A. On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math., 24: 88–96, 1973.
Ulam S. Adventures of a Mathematician. Scribner’s, New York, NY, 1976.
Zinoviev V. A., and Leontiev V. K., The non-existence of perfect codes over Galois fields, Probl. Contr. Inform. Theory, 2: 123–132, 1973.
Acknowledgements
We are grateful to Franco Montagna for his valuable assistance in the writing of the proof of (iii) ⇒ (iv) in Theorem 8.1. We also thank Manuela Busaniche for her further simplification of this proof.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Cicalese*, F., Mundici, D. (2011). Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic. In: van Benthem, J., Gupta, A., Parikh, R. (eds) Proof, Computation and Agency. Synthese Library, vol 352. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0080-2_8
Download citation
DOI: https://doi.org/10.1007/978-94-007-0080-2_8
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0079-6
Online ISBN: 978-94-007-0080-2
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)