An Upper Bound on Broadcast Subspace Codes

TL;DR

This paper introduces an algebraic coding framework for linear operator broadcast channels, providing a Hamming-like upper bound on multishot subspace codes to improve understanding of multi-rate network broadcasting.

Contribution

It presents the first algebraic coding framework for LOBCs and derives a novel upper bound on subspace codes, advancing theoretical limits in network coding.

Findings

Established a Hamming-like upper bound for subspace codes

Developed an algebraic framework for LOBCs

Enhanced understanding of coding limits in network broadcasting

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.