Polytope Codes Against Adversaries in Networks

This paper investigates a network coding problem wherein an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than that of an adversary controlling a given number of edges in the network, in that linear codes are...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2014-06, Vol.60 (6), p.3308-3344
Hauptverfasser:	Kosut, Oliver, Lang Tong, Tse, David N. C.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Codes Coding Coding, codes Constants Educational institutions Exact sciences and technology Fields (mathematics) Information theory Information, signal and communications theory Linear codes Mathematical analysis Network coding Networks Normal distribution Polytopes Signal and communications theory Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Upper bound Vectors Vectors (mathematics) Xenon
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!