AI Chat AI Image Generator AI Video Text to Speech

Efficient Decoding of Interleaved Low-Rank Parity-Check Codes

08/28/2019

∙

by Julian Renner, et al.

∙

∙

An efficient decoding algorithm for horizontally u-interleaved LRPC codes is proposed and analyzed. Upper bounds on the decoding failure rate and the computational complexity of the algorithm are derived. It is shown that interleaving reduces the decoding failure rate exponentially in the interleaving order u whereas the computational complexity grows linearly.

Julian Renner
16 publications
Thomas Jerkovits
13 publications
Hannes Bartz
22 publications

page 1

page 2

page 3

page 4

research

∙ 05/03/2023

Generalized LRPC codes

In this paper we generalize the notion of low-rank parity check (LRPC) c...

0 Ermes Franch, et al. ∙

research

∙ 05/09/2023

Two new algorithms for error support recovery of low rank parity check codes

Due to their weak algebraic structure, low rank parity check (LRPC) code...

0 Ermes Franch, et al. ∙

research

∙ 01/15/2018

The decoding failure probability of MDPC codes

Moderate Density Parity Check (MDPC) codes are defined here as codes whi...

0 Jean-Pierre Tillich, et al. ∙

research

∙ 09/26/2013

Optimization With Parity Constraints: From Binary Codes to Discrete Integration

Many probabilistic inference tasks involve summations over exponentially...

0 Stefano Ermon, et al. ∙

research

∙ 06/14/2023

Early-Stopped Technique for BCH Decoding Algorithm Under Tolerant Fault Probability

In this paper, a technique for the Berlekamp-Massey(BM) algorithm is pro...

0 Hong-fu Chou, et al. ∙

research

∙ 06/29/2021

Generalizing Syndrome Decoding problem to the totally Non-negative Grassmannian

The syndrome decoding problem has been proposed as a computational hardn...

0 Kelechi Chuwkunonyerem Emerole, et al. ∙

research

∙ 05/07/2023

Fast Blind Recovery of Linear Block Codes over Noisy Channels

This paper addresses the blind recovery of the parity check matrix of an...

0 Peng Wang, et al. ∙