A Deterministic Polynomial-Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks

We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi to linear deterministic relay networks and is based on the notion of flow for a unicast...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 59; H. 11; S. 7541 - 7552
Hauptverfasser: Tabatabaei Yazdi, S. M. Sadegh, Savari, Serap A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.11.2013
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Applied sciences
Coding theory
Computer science
Computers
Conferences
Data compression
Educational institutions
Electrical engineering
Exact sciences and technology
Information literacy
Information theory
Information, signal and communications theory
Linear codes
Linear deterministic network
multicast session
network coding
Polynomials
Research and development
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
wireless Gaussian network
Wireless networks
Packet switching
Relay network
Wireless telecommunication
wireless Gaussian network
Polynomial method
Data broadcast
Information dissemination
Polynomial time
Multicast
multicast session
Linear deterministic network
Network coding
Wireless network
Deterministic approach
Deterministic algorithms
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi to linear deterministic relay networks and is based on the notion of flow for a unicast session that was introduced by the authors in earlier work. We present randomized and deterministic polynomial-time versions of our algorithm and show that for a network with g destinations, our deterministic algorithm can achieve the capacity in [log(g+1)] uses of the network and has the fastest construction time among algorithms for this problem.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2013.2273793