An Upper Bound on Broadcast Subspace Codes
Information Theory
2011-10-19 v1 Algebraic Geometry
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.1110.3855,
title = {An Upper Bound on Broadcast Subspace Codes},
author = {Yimin Pang and Thomas Honold},
journal= {arXiv preprint arXiv:1110.3855},
year = {2011}
}
Comments
4 pages; The 1st International ICST Workshop on Network Coding in Wireless Relay Networks, 2011