MARC보기
LDR00000nmm u2200205 4500
001000000332662
00520241204112437
008181129s2018 ||| | | | eng d
020 ▼a 9780438077157
035 ▼a (MiAaPQ)AAI10790290
035 ▼a (MiAaPQ)iastate:17298
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 248032
0491 ▼f DP
0820 ▼a 621.3
1001 ▼a Tripathy, Ardhendu Shekhar. ▼0 (orcid)0000-0003-1893-4891
24510 ▼a Network Coding for Function Computation.
260 ▼a [S.l.] : ▼b Iowa State University., ▼c 2018
260 1 ▼a Ann Arbor : ▼b ProQuest Dissertations & Theses, ▼c 2018
300 ▼a 120 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 79-11(E), Section: B.
500 ▼a Adviser: Aditya Ramamoorthy.
5021 ▼a Thesis (Ph.D.)--Iowa State University, 2018.
520 ▼a Many applications such as parallel processing, distributed data analytics and sensor networks often need to compute functions of data that are observed in a distributed manner over a network. A network can be modeled as a directed graph, each ve
520 ▼a In the first part of this thesis, we assume that the message random variables are independent and uniformly distributed over a finite field. The demand function is set to be the finite field sum of all the messages observed in the network. A val
520 ▼a In the second part of the thesis, we focus on a particular directed acyclic network that has four nodes and four edges. It is the simplest instance of a network that does not have a tree structure. Three of the nodes are sources that observe ind
590 ▼a School code: 0097.
650 4 ▼a Electrical engineering.
650 4 ▼a Information science.
650 4 ▼a Mathematics.
690 ▼a 0544
690 ▼a 0723
690 ▼a 0405
71020 ▼a Iowa State University. ▼b Electrical and Computer Engineering.
7730 ▼t Dissertation Abstracts International ▼g 79-11B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0097
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14997556 ▼n KERIS
980 ▼a 201812 ▼f 2019
990 ▼a 관리자 ▼b 관리자