An Upper Bound on Broadcast Subspace Codes

An Upper Bound on Broadcast Subspace Codes

Linear operator broadcast channel (LOBC) models the scenario of multi-rate packet broadcasting over a network, when random network coding is applied. This paper presents the framework of algebraic coding for LOBCs and provides a Hamming-like upper bound on (multishot) subspace codes for LOBCs.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Pang, Yimin, Honold, Thomas
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Theory
Mathematics - Algebraic Geometry
Mathematics - Information Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Linear operator broadcast channel (LOBC) models the scenario of multi-rate packet broadcasting over a network, when random network coding is applied. This paper presents the framework of algebraic coding for LOBCs and provides a Hamming-like upper bound on (multishot) subspace codes for LOBCs.
DOI:10.48550/arxiv.1110.3855