Lattice Erasure Codes of Low Rank with Noise Margins

01/13/2018
by   Vinay A. Vaishampayan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2020

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...
research
09/16/2020

Twisted Reed-Solomon Codes With One-dimensional Hull

The hull of a linear code is defined to be the intersection of the code ...
research
01/14/2020

Partial MDS Codes with Local Regeneration

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure cod...
research
09/20/2022

On additive MDS codes with linear projections

We support some evidence that a long additive MDS code over a finite fie...
research
10/18/2019

Infinite families of near MDS codes holding t-designs

An [n, k, n-k+1] linear code is called an MDS code. An [n, k, n-k] linea...
research
11/27/2019

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

In this work, we present a novel robust distributed beamforming (RDB) ap...
research
12/19/2017

Algebraic lattice codes for linear fading channels

In the decades following Shannon's work, the quest to design codes for t...

Please sign up or login with your details

Forgot password? Click here to reset