國立虎尾科技大學 |

Linear Network Coding over Ring Alphabets.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Linear Network Coding over Ring Alphabets./
作者:	Connelly, Joseph Michael.
面頁冊數:	1 online resource (200 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
Contained By:	Dissertation Abstracts International79-12B(E).
標題:	Electrical engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9780438167537

Linear Network Coding over Ring Alphabets.
Connelly, Joseph Michael.

Linear Network Coding over Ring Alphabets. - 1 online resource (200 pages)

Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.

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

Includes bibliographical references

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 information represented as sequences of bits or elements of some other finite alphabet. By allowing users to transmit functions of their inputs, as opposed to simply relaying received data, the information throughput of a network can be increased. Network codes in which these functions are linear are sub-optimal in general but are of practical interest due to their mathematical tractability and low implementation complexity. The study of linear network coding has primarily been limited to finite field alphabets. In this work, we consider linear network codes over more general algebraically-structured alphabets, namely finite rings. We contrast linear network codes over finite fields, commutative rings, and non-commutative rings, and we discuss cases where non-linear codes attain higher information rates than even very general linear codes. Our results show that finite fields are, in some sense, the best ring alphabets for linear network coding, but in certain instances, it may be advantageous to use linear coding over some other ring alphabet of the same size.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780438167537Subjects--Topical Terms:

596380
Electrical engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Linear Network Coding over Ring Alphabets.
LDR:03626ntm a2200361Ki 4500 001 919148
005 20181116131020.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438167537
035 $a (MiAaPQ)AAI10747559
035 $a (MiAaPQ)ucsd:17199
035 $a AAI10747559
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Connelly, Joseph Michael. $3 1193654
245 1 0 $a Linear Network Coding over Ring Alphabets.
264 0 $c 2018
300 $a 1 online resource (200 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
500 $a Adviser: Kenneth Zeger.
502 $a Thesis (Ph.D.)--University of California, San Diego, 2018.
504 $a Includes bibliographical references
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 information represented as sequences of bits or elements of some other finite alphabet. By allowing users to transmit functions of their inputs, as opposed to simply relaying received data, the information throughput of a network can be increased. Network codes in which these functions are linear are sub-optimal in general but are of practical interest due to their mathematical tractability and low implementation complexity. The study of linear network coding has primarily been limited to finite field alphabets. In this work, we consider linear network codes over more general algebraically-structured alphabets, namely finite rings. We contrast linear network codes over finite fields, commutative rings, and non-commutative rings, and we discuss cases where non-linear codes attain higher information rates than even very general linear codes. Our results show that finite fields are, in some sense, the best ring alphabets for linear network coding, but in certain instances, it may be advantageous to use linear coding over some other ring alphabet of the same size.
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 network that is linearly solvable over the ring but not over any other commutative ring of the same size. We show that these rings are, in some sense, the best commutative rings of a given size for linear network coding. We then present an infinite class of networks that are linearly solvable over certain non-commutative rings but not over any commutative rings. We also prove that vector linear codes over finite fields minimize the alphabet size needed for linear solvability, which is desirable from an implementation complexity standpoint. (ii) network capacity: how much information per channel use can be sent to the network's receivers in the limit of large block sizes for transmission. We show that the linear coding capacity of a given network cannot be increased by looking beyond finite fields to more general rings.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Electrical engineering. $3 596380
650 4 $a Information science. $3 561178
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0544
690 $a 0723
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of California, San Diego. $b Electrical Engineering (Communication Theory and Systems). $3 1193655
773 0 $t Dissertation Abstracts International $g 79-12B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10747559 $z click for full text (PQDT)