An Upper Bound on Broadcast Subspace Codes

2011/10/18 by Yimin Pang, Pang, Yimin, Thomas Honold +1
Computer Science · Engineering · #94B65 #Advanced Wireless Communication Technologies #Algebraic Geometry (math.AG) #Cooperative Communication and Network Coding #E.4 #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1110.3855

openalex publication_date 2011/10/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Multishot Codes for Network Coding using Rank-Metric Codes

Related

• Towards the Capacity Region of Multiplicative Linear Operator Broadcast Channels
• Combining subspace codes with classical linear error-correcting codes
• Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach
• Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks
• On the Capacity of Non-Coherent Network Coding