Guessing with lies

dc.citation.spage208en_US
dc.contributor.authorArıkan, Erdalen_US
dc.contributor.authorBoztaş, S.en_US
dc.coverage.spatialLausanne, Switzerland
dc.date.accessioned2016-02-08T11:56:43Z
dc.date.available2016-02-08T11:56:43Z
dc.date.issued2002-06-07en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 30 June-5 July 2002
dc.descriptionConference name: Proceedings IEEE International Symposium on Information Theory, 2002
dc.description.abstractA practical algorithm was obtained for directly generating an optimal guessing sequence for guessing under lies. An optimal guessing strategy was defined as one which minimizes the number of average number of guesses in determining the correct value of a random variable. The information-theoretic bounds on the average number of guesses for optimal strategies were also derived.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:56:43Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2002en
dc.identifier.doi10.1109/ISIT.2002.1023480
dc.identifier.urihttp://hdl.handle.net/11693/27567
dc.language.isoEnglishen_US
dc.publisherIEEE
dc.relation.isversionofhttps://doi.org/10.1109/ISIT.2002.1023480
dc.source.titleIEEE International Symposium on Information Theory - Proceedingsen_US
dc.subjectSequential decodingen_US
dc.subjectAlgorithmsen_US
dc.subjectConstraint theoryen_US
dc.subjectDecision theoryen_US
dc.subjectDynamic programmingen_US
dc.subjectInformation theoryen_US
dc.subjectProbability distributionsen_US
dc.subjectProblem solvingen_US
dc.subjectRandom processesen_US
dc.subjectSignal encodingen_US
dc.subjectDecodingen_US
dc.titleGuessing with liesen_US
dc.typeConference Paperen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Guessing with lies.pdf
Size:
125.1 KB
Format:
Adobe Portable Document Format
Description:
Full printable version