2000 character limit reached
An Upper Bound on Broadcast Subspace Codes
Published 18 Oct 2011 in cs.IT, math.AG, and math.IT | (1110.3855v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
