2018/01/13 by Vaishampayan, Vinay A.
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1801.04466
We consider the following generalization of an (n,k) MDS code for application to an erasure channel with additive noise. Like an MDS code, our code is required to be decodable from any k received symbols, in the absence of noise. In addition, we require that the noise margin for every allowable erasure pattern be as large as possible and that the code satisfy a power constraint. In this paper we derive performance bounds and present a few designs for low rank lattice codes for an additive noise channel with erasures.