東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Structured Codes for Network Communication.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Structured Codes for Network Communication./
作者:	Sen, Pinar.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2020,
面頁冊數:	216 p.
附註:	Source: Dissertations Abstracts International, Volume: 82-04, Section: B.
Contained By:	Dissertations Abstracts International82-04B.
標題:	Electrical engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27999167
ISBN:	9798672188720

Structured Codes for Network Communication.
Sen, Pinar.

Structured Codes for Network Communication. - Ann Arbor : ProQuest Dissertations & Theses, 2020 - 216 p.

Source: Dissertations Abstracts International, Volume: 82-04, Section: B.

Thesis (Ph.D.)--University of California, San Diego, 2020.

This item must not be sold to any third party vendors.

Random independently and identically distributed code ensembles play a fundamental role in characterizing the limits of communication rates over different network models, with most existing coding schemes built on them. It has been shown in various problems, on the other hand, these conventional random coding schemes are outperformed by \\emph{structured} ones that are well-suited to the problem of interest, resulting in strictly better communication rates. This dissertation investigates the benefits of structured codes for a wider class of network models that can be grouped into two parts. In the first part, a special code structure that is built on linearity shared by multiple senders is studied for the two conflicting canonical problems defined over multiple access channels: linear computation of codewords and message communication. For linear computation, the optimal decoding performance of such structured codes is analyzed, which yields strictly larger rates than random coding. For message communication, it is shown that the aforementioned family of structured codes can achieve the optimal tradeoff between communication rates. In the second part, a structured transmission scheme, referred to as caching, is studied to reduce the network load between a server that stores a set of file contents and users that request a file from the server. To cope with the unpredictable nature of file contents and user requests, two new caching problems are formulated. As an answer to these caching problems, a successive refinement approach is proposed to store some partial information about file contents in small increments into the memories of end users. These results motivate further research into the potential of structured codes in network communication.

ISBN: 9798672188720Subjects--Topical Terms:

649834
Electrical engineering.
Subjects--Index Terms:

Coded caching

Structured Codes for Network Communication.
LDR:02960nmm a2200385 4500 001 2344570
005 20220531064556.5
008 241004s2020 ||||||||||||||||| ||eng d
020 $a 9798672188720
035 $a (MiAaPQ)AAI27999167
035 $a AAI27999167
040 $a MiAaPQ $c MiAaPQ
100 1 $a Sen, Pinar. $3 3683357
245 1 0 $a Structured Codes for Network Communication.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2020
300 $a 216 p.
500 $a Source: Dissertations Abstracts International, Volume: 82-04, Section: B.
500 $a Advisor: Kim, Young-Han.
502 $a Thesis (Ph.D.)--University of California, San Diego, 2020.
506 $a This item must not be sold to any third party vendors.
520 $a Random independently and identically distributed code ensembles play a fundamental role in characterizing the limits of communication rates over different network models, with most existing coding schemes built on them. It has been shown in various problems, on the other hand, these conventional random coding schemes are outperformed by \\emph{structured} ones that are well-suited to the problem of interest, resulting in strictly better communication rates. This dissertation investigates the benefits of structured codes for a wider class of network models that can be grouped into two parts. In the first part, a special code structure that is built on linearity shared by multiple senders is studied for the two conflicting canonical problems defined over multiple access channels: linear computation of codewords and message communication. For linear computation, the optimal decoding performance of such structured codes is analyzed, which yields strictly larger rates than random coding. For message communication, it is shown that the aforementioned family of structured codes can achieve the optimal tradeoff between communication rates. In the second part, a structured transmission scheme, referred to as caching, is studied to reduce the network load between a server that stores a set of file contents and users that request a file from the server. To cope with the unpredictable nature of file contents and user requests, two new caching problems are formulated. As an answer to these caching problems, a successive refinement approach is proposed to store some partial information about file contents in small increments into the memories of end users. These results motivate further research into the potential of structured codes in network communication.
590 $a School code: 0033.
650 4 $a Electrical engineering. $3 649834
650 4 $a Computer science. $3 523869
650 4 $a Technical communication. $3 3172863
653 $a Coded caching
653 $a Dynamic caching
653 $a Linear codes
653 $a Multiple access channels
653 $a Network information theory
653 $a Structured codes
690 $a 0544
690 $a 0984
690 $a 0643
710 2 $a University of California, San Diego. $b Electrical and Computer Engineering. $3 3432690
773 0 $t Dissertations Abstracts International $g 82-04B.
790 $a 0033
791 $a Ph.D.
792 $a 2020
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27999167