자료유형 | 학위논문 |
---|---|
서명/저자사항 | Linear Network Coding over Ring Alphabets. |
개인저자 | Connelly, Joseph Michael. |
단체저자명 | University of California, San Diego. Electrical Engineering (Communication Theory and Systems). |
발행사항 | [S.l.]: University of California, San Diego., 2018. |
발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
형태사항 | 200 p. |
기본자료 저록 | Dissertation Abstracts International 79-12B(E). Dissertation Abstract International |
ISBN | 9780438167537 |
학위논문주기 | Thesis (Ph.D.)--University of California, San Diego, 2018. |
일반주기 |
Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
Adviser: Kenneth Zeger. |
요약 | 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 |
요약 | 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 |
일반주제명 | Electrical engineering. Information science. Computer science. |
언어 | 영어 |
바로가기 |
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |