Superposition coding for linear operator channels over finite fields

Abstract

A coding approach based on the superposition structure is proposed for linear operator channels. Under a subspace decoding rule, a lower bound on the maximum achievable rate of this coding approach is characterized. Under the subspace decoding rule, this coding approach is capacity achieving for a class of linear operator channels, and it can potentially achieve higher rates than the subspace coding approach.