Linear Network Coding: Theory and Algorithms

Network coding is a new paradigm in data transport that combines coding with data propagation over a network. Theory of linear network coding (LNC) adopts a linear coding scheme at every node of the network and promises the optimal data transmission rate from the source to all receivers. Linearity e...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the IEEE Ročník 99; číslo 3; s. 372 - 387
Hlavní autoři: Li, Shuo-Yen Robert, Sun, Qifu Tyler, Shao, Ziyu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.03.2011
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:0018-9219, 1558-2256
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Network coding is a new paradigm in data transport that combines coding with data propagation over a network. Theory of linear network coding (LNC) adopts a linear coding scheme at every node of the network and promises the optimal data transmission rate from the source to all receivers. Linearity enhances the theoretic elegance and engineering simplicity, which leads to wide applicability. This paper reviews the basic theory of LNC and construction algorithms for optimal linear network codes. Exemplifying applications are presented, including random LNC. The fundamental theorem of LNC applies to only acyclic networks, but practical applications actually ignore the acyclic restriction. The theoretic justification for this involves convolutional network coding (CNC), which, however, incurs the difficulty of precise synchronization. The problem can be alleviated when CNC is generalized by selecting an appropriate structure in commutative algebra for data units. This paper tries to present the necessary algebraic concepts as much as possible in engineering language.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0018-9219
1558-2256
DOI:10.1109/JPROC.2010.2093851