Universal communication and clustering
Abstract/Contents
- Abstract
- Information theory has a history of marrying elegant mathematical models with a wide scope of applications. In an attempt to follow this tradition, we start with questions of universality in communications, and end with surprising connections to clustering, compression, and prediction. Two specific information theoretic scenarios are considered: universal pattern decoding for an unknown codebook across an unknown channel, and universal encoding and decoding across a modulo-additive channel with noiseless feedback. In both settings, fundamental limits are established, and practical algorithms and tools are constructed to achieve these bounds. Applications are briefly discussed both for evaluating the semantic similarity of search queries, and for comparing human populations based on the genotypes of various individuals.
Description
| Type of resource | text |
|---|---|
| Form | electronic; electronic resource; remote |
| Extent | 1 online resource. |
| Publication date | 2014 |
| Issuance | monographic |
| Language | English |
Creators/Contributors
| Associated with | Misra, Vinith |
|---|---|
| Associated with | Stanford University, Department of Electrical Engineering. |
| Primary advisor | Weissman, Tsachy |
| Thesis advisor | Weissman, Tsachy |
| Thesis advisor | El Gamal, Abbas A |
| Thesis advisor | Goldsmith, Andrea, 1964- |
| Advisor | El Gamal, Abbas A |
| Advisor | Goldsmith, Andrea, 1964- |
Subjects
| Genre | Theses |
|---|
Bibliographic information
| Statement of responsibility | Vinith Misra. |
|---|---|
| Note | Submitted to the Department of Electrical Engineering. |
| Thesis | Thesis (Ph.D.)--Stanford University, 2014. |
| Location | electronic resource |
Access conditions
- Copyright
- © 2014 by Vinith Misra
- License
- This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).
Also listed in
Loading usage metrics...