Cart (Loading....) | Create Account
Close category search window

The exact information complexity of Indian poker

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ozarow, L.H. ; AT&T Bell Lab., Murray Hill, NJ, USA ; Shepp, L.A.

Suppose N people are in a circle and each has a K-bit integer on his forehead and can see the others' integers but does not know his own. The problem is to determine how many bits of information must be exchanged among the players so that each can determine his own number after the exchange. The authors provide an algorithm for which the number of bits that suffices equals K plus the least integer ⩾K/(N-1). In particular, if N>K, the total of NK bits can be resolved in K+1 transmissions. Since K bits are required to resolve any of the numbers, this is quite efficient, and is shown to be optimal. In addition, the optimal strategy is obtained when the numbers are of different lengths

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 1 )

Date of Publication:

Jan 1990

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.