| LDR | | 01983nam u200433 4500 |
| 001 | | 000000418137 |
| 005 | | 20190215162618 |
| 008 | | 181129s2018 |||||||||||||||||c||eng d |
| 020 | |
▼a 9780438167537 |
| 035 | |
▼a (MiAaPQ)AAI10747559 |
| 035 | |
▼a (MiAaPQ)ucsd:17199 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 621.3 |
| 100 | 1 |
▼a Connelly, Joseph Michael. |
| 245 | 10 |
▼a Linear Network Coding over Ring Alphabets. |
| 260 | |
▼a [S.l.]:
▼b University of California, San Diego.,
▼c 2018. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2018. |
| 300 | |
▼a 200 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B. |
| 500 | |
▼a Adviser: Kenneth Zeger. |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of California, San Diego, 2018. |
| 520 | |
▼a As connected devices play an ever-growing role in our society, there is a subsequent need for advances in multi-user communication systems. In a network, senders and receivers are connected via a series of intermediate users who share informatio |
| 520 | |
▼a Specifically, we prove results related to: (i) network solvability : whether or not a network's receivers can obtain their desired information using codes over a given alphabet. We characterize the commutative rings for which there exists a netw |
| 590 | |
▼a School code: 0033. |
| 650 | 4 |
▼a Electrical engineering. |
| 650 | 4 |
▼a Information science. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0544 |
| 690 | |
▼a 0723 |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a University of California, San Diego.
▼b Electrical Engineering (Communication Theory and Systems). |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 79-12B(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0033 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T14996933
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a ***1012033 |