Jump to content United States-English
HP.com Home Products and Services Support and Drivers Solutions How to Buy
» Contact HP

HP.com home


Information Theory Seminar


printable version
» 

HP Labs

» Research
» News and events
» Technical reports
» About HP Labs
» Careers @ HP Labs
» People
» Worldwide sites
» Downloads
Content starts here

TITLE: Guessing based on length functions

SPEAKER: Rajesh Sundaresan (Indian Institute of Science, Bangalore)

DATE: 2:00 - 3:00 PM, Thursday, July 26, 2007

LOCATION: Tahoe, 3U

ABSTRACT:
This talk will be on a guessing wiretapper's performance on a Shannon cipher system. I will first highlight the close connection between guessing and compression. Good compressors can then be leveraged to identify good guessing schemes. Subsequently, I will discuss some guessing universality properties of minimum description length codes and Lempel-Ziv codes. If time permits, I will talk about the Pythagorean property of a notion of guessing redundancy.

BIOGRAPHY:
Rajesh Sundaresan is an Assistant Professor at the Indian Institute of Science, Bangalore, India. Prior to joining IISc in 2005, he was a Senior Staff Engineer at Qualcomm Inc., Campbell, where he worked on algorithm design for WCDMA and HSDPA modems. He received his Ph.D. from Princeton University. He is currently visiting Qualcomm Inc., Campbell.

Seminars

» Information Theory
» Publications
» People
» Discrete Universal Denoiser (DUDE)
» Elliptic Curve Cryptography
» Image Compression
» Seminars
» Related Links
This is a controller for a color printer. Each chip contains a compressor/decompressor based on an algorithm created by HP Labs.
Privacy statement Using this site means you accept its terms Feedback to HP Labs
© 2009 Hewlett-Packard Development Company, L.P.