Random network coding over composite fields

Olav Geil; Daniel Enrique Lucani Rötter

doi:10.1007/978-3-319-66278-7_11

Random network coding over composite fields

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Abstract

Random network coding is a method that achieves multicast capacity asymptotically for general networks [1, 7]. In this approach, vertices in the network randomly and linearly combine incoming information in a distributed manner before forwarding it through their outgoing edges. To ensure success, the involved finite field needs to be large enough [2, 7], which can be an obstacle if some inner (intermediate) nodes have less computational power than others. In this work, we analyze what can be achieved if different nodes are allowed to use different finite fields from a selection of fields all contained in some composite extension finite field [3, 5].

Original language	English
Title of host publication	Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings : ICMCTA 2017
Editors	A Barbero, V. Skacheck, Ø. Ytrehus
Number of pages	10
Publisher	Springer
Publication date	23 Aug 2017
Pages	118-127
ISBN (Print)	978-3-319-66277-0
ISBN (Electronic)	978-3-319-66278-7
DOIs	https://doi.org/10.1007/978-3-319-66278-7_11
Publication status	Published - 23 Aug 2017
Event	5th International Castle Meeting on Coding Theory and Applications - Vihula Manor, Estonia Duration: 28 Aug 2017 → 31 Aug 2017 http://www.castle-meeting-2017.ut.ee/

Conference

Conference	5th International Castle Meeting on Coding Theory and Applications
Location	Vihula Manor
Country/Territory	Estonia
Period	28/08/2017 → 31/08/2017
Internet address	http://www.castle-meeting-2017.ut.ee/

Series	Lecture Notes in Computer Science
Volume	10495
ISSN	0302-9743

Keywords

Composite fields
Random network coding
Success probability

Access to Document

10.1007/978-3-319-66278-7_11

Cite this

@inproceedings{4e24c4611c2647bebfa6c403528a72d6,

title = "Random network coding over composite fields",

abstract = "Random network coding is a method that achieves multicast capacity asymptotically for general networks [1, 7]. In this approach, vertices in the network randomly and linearly combine incoming information in a distributed manner before forwarding it through their outgoing edges. To ensure success, the involved finite field needs to be large enough [2, 7], which can be an obstacle if some inner (intermediate) nodes have less computational power than others. In this work, we analyze what can be achieved if different nodes are allowed to use different finite fields from a selection of fields all contained in some composite extension finite field [3, 5].",

keywords = "Composite fields, Random network coding, Success probability",

author = "Olav Geil and {Lucani R{\"o}tter}, {Daniel Enrique}",

year = "2017",

month = aug,

day = "23",

doi = "10.1007/978-3-319-66278-7_11",

language = "English",

isbn = "978-3-319-66277-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "118--127",

editor = "A Barbero and V. Skacheck and {\O}. Ytrehus",

booktitle = "Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings",

address = "Netherlands",

note = "5th International Castle Meeting on Coding Theory and Applications ; Conference date: 28-08-2017 Through 31-08-2017",

url = "http://www.castle-meeting-2017.ut.ee/",

}

Geil, O & Lucani Rötter, DE 2017, Random network coding over composite fields. in A Barbero, V Skacheck & Ø Ytrehus (eds), Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings: ICMCTA 2017. Springer, Lecture Notes in Computer Science, vol. 10495, pp. 118-127, 5th International Castle Meeting on Coding Theory and Applications, Estonia, 28/08/2017. https://doi.org/10.1007/978-3-319-66278-7_11

Random network coding over composite fields. / Geil, Olav; Lucani Rötter, Daniel Enrique.
Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings: ICMCTA 2017. ed. / A Barbero; V. Skacheck; Ø. Ytrehus. Springer, 2017. p. 118-127 (Lecture Notes in Computer Science, Vol. 10495).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Random network coding over composite fields

AU - Geil, Olav

AU - Lucani Rötter, Daniel Enrique

PY - 2017/8/23

Y1 - 2017/8/23

N2 - Random network coding is a method that achieves multicast capacity asymptotically for general networks [1, 7]. In this approach, vertices in the network randomly and linearly combine incoming information in a distributed manner before forwarding it through their outgoing edges. To ensure success, the involved finite field needs to be large enough [2, 7], which can be an obstacle if some inner (intermediate) nodes have less computational power than others. In this work, we analyze what can be achieved if different nodes are allowed to use different finite fields from a selection of fields all contained in some composite extension finite field [3, 5].

AB - Random network coding is a method that achieves multicast capacity asymptotically for general networks [1, 7]. In this approach, vertices in the network randomly and linearly combine incoming information in a distributed manner before forwarding it through their outgoing edges. To ensure success, the involved finite field needs to be large enough [2, 7], which can be an obstacle if some inner (intermediate) nodes have less computational power than others. In this work, we analyze what can be achieved if different nodes are allowed to use different finite fields from a selection of fields all contained in some composite extension finite field [3, 5].

KW - Composite fields

KW - Random network coding

KW - Success probability

UR - http://www.scopus.com/inward/record.url?scp=85028574084&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-66278-7_11

DO - 10.1007/978-3-319-66278-7_11

M3 - Article in proceedings

SN - 978-3-319-66277-0

T3 - Lecture Notes in Computer Science

SP - 118

EP - 127

BT - Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings

A2 - Barbero, A

A2 - Skacheck, V.

A2 - Ytrehus, Ø.

PB - Springer

T2 - 5th International Castle Meeting on Coding Theory and Applications

Y2 - 28 August 2017 through 31 August 2017

ER -

Random network coding over composite fields

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this