DeepAI AI Chat
Log In Sign Up

Lattice Erasure Codes of Low Rank with Noise Margins

by   Vinay A. Vaishampayan, et al.

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.


page 1

page 2

page 3

page 4


On additive MDS codes over small fields

Let C be a (n,q^2k,n-k+1)_q^2 additive MDS code which is linear over 𝔽_q...

Twisted Reed-Solomon Codes With One-dimensional Hull

The hull of a linear code is defined to be the intersection of the code ...

Partial MDS Codes with Local Regeneration

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure cod...

On additive MDS codes with linear projections

We support some evidence that a long additive MDS code over a finite fie...

MDS and I-Perfect Codes in Pomset block Metric

In this paper, we establish the Singleton bound for pomset block codes (...

Study of Distributed Robust Beamforming with Low-Rank and Cross-Correlation Techniques

In this work, we present a novel robust distributed beamforming (RDB) ap...

The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes

In this paper we consider the diversity-multiplexing gain tradeoff (DMT)...