An Upper Bound on Broadcast Subspace Codes
classification
💻 cs.IT
math.AGmath.IT
keywords
boundbroadcastcodescodinglobcsnetworksubspaceupper
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.