| LDR | | 00000nam u2200205 4500 |
| 001 | | 000000434967 |
| 005 | | 20200227112704 |
| 008 | | 200131s2018 ||||||||||||||||| ||eng d |
| 020 | |
▼a 9781687935168 |
| 035 | |
▼a (MiAaPQ)AAI27536308 |
| 035 | |
▼a (MiAaPQ)umichrackham002267 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 020 |
| 100 | 1 |
▼a Heidari Khoozani, Mohsen. |
| 245 | 10 |
▼a Capacity, Error Exponent, and Structural Results for Communication Networks. |
| 260 | |
▼a [S.l.]:
▼b University of Michigan.,
▼c 2018. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2018. |
| 300 | |
▼a 218 p. |
| 500 | |
▼a Source: Dissertations Abstracts International, Volume: 81-05, Section: A. |
| 500 | |
▼a Advisor: Pradhan, S. Sandeep. |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of Michigan, 2018. |
| 506 | |
▼a This item must not be sold to any third party vendors. |
| 506 | |
▼a This item must not be added to any third party search indexes. |
| 520 | |
▼a In various multi-terminal communication scenarios, contrary to point-to-point communication, characterization of fundamental limits such as capacity and error exponent is still an open problem. We study such fundamental limits and the structure of optimality achieving codes. This thesis consists of two parts: in the first part, we investigate the role of algebraic structures in multi-terminal communications. We show the necessity of various types of algebraic structure in capacity achieving codes and argue that the lack of such structures in the conventional random codes leads to their sub-optimality. We develop a new class of partially structured codes called quasi-structured code (QSC). Such codes span the spectrum from completely structured to completely unstructured codes. It is shown that the application of QSCs leads to improvements over the current coding strategies for many problems including distributed source coding and multiple-access channel (MAC) with feedback. In the second part of the thesis, we study the optimal error exponent in various multi-terminal communication scenarios. We derive a lower and upper bound on the error exponent of discrete memoryless MAC with noiseless feedback and variable-length codes (VLCs). The bounds increase linearly with respect to a specific Euclidean distance measure defined between the transmission rate pair and the capacity boundary. The bounds are shown to be tight for specific classes of MACs. |
| 590 | |
▼a School code: 0127. |
| 650 | 4 |
▼a Electrical engineering. |
| 650 | 4 |
▼a Information science. |
| 690 | |
▼a 0544 |
| 690 | |
▼a 0723 |
| 710 | 20 |
▼a University of Michigan.
▼b Electrical Engineering: Systems. |
| 773 | 0 |
▼t Dissertations Abstracts International
▼g 81-05A. |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0127 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15494251
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 202002
▼f 2020 |
| 990 | |
▼a ***1008102 |
| 991 | |
▼a E-BOOK |