On Error Decoding of Locally Repairable and Partial MDS Codes

04/11/2019
by   Lukas Holzbaur, et al.
0

We consider error decoding of locally repairable codes (LRC) and partial MDS (PMDS) codes through interleaved decoding. For a specific class of LRCs we investigate the success probability of interleaved decoding. For PMDS codes we show that there is a wide range of parameters for which interleaved decoding can increase their decoding radius beyond the minimum distance with the probability of successful decoding approaching 1, when the code length goes to infinity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2019

Error Decoding of Locally Repairable and Partial MDS Codes

In this work it is shown that locally repairable codes (LRCs) can be lis...
research
01/12/2018

List Decoding of Locally Repairable Codes

We show that locally repairable codes (LRCs) can be list decoded efficie...
research
08/23/2021

Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel

Using tools developed in a recent work by Shen and the second author, in...
research
01/22/2018

Improved Power Decoding of Interleaved One-Point Hermitian Codes

We propose a new partial decoding algorithm for h-interleaved one-point ...
research
03/28/2019

Successive-Cancellation Decoding of Linear Source Code

This paper investigates the error probability of several decoding method...
research
02/27/2020

NP-Complete Problems for Lee Metric Codes

We consider codes over finite rings endowed with the Lee metric and prov...
research
03/06/2018

ART-UP: A Novel Method for Generating Scanning-robust Aesthetic QR codes

QR codes are usually scanned in different environments, so they must be ...

Please sign up or login with your details

Forgot password? Click here to reset