Low Row Rank Parity Check Codes

04/16/2021
by   Ermes Franch, et al.
0

In this paper we present an extended variant of low rank parity check matrix (LRPC) codes that have received significant interests in recent years. It is shown that the extension indeed yields a superfamily of LRPC codes, which are termed low row rank parity check codes. The decoding method of the proposed codes is also investigated.

READ FULL TEXT

page 1

page 2

page 3

page 4

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...
research
10/07/2022

Punctured Binary Simplex Codes as LDPC codes

Digital data transfer can be protected by means of suitable error correc...
research
10/21/2022

Left ideal LRPC codes and a ROLLO-type cryptosystem based on group algebras

In this paper we introduce left ideal low-rank parity-check codes by usi...
research
03/02/2021

Efficient Encoding Algorithm of Binary and Non-Binary LDPC Codes Using Block Triangulation

We propose an efficient encoding algorithm for the binary and non-binary...
research
05/08/2020

Sparsifying Parity-Check Matrices

Parity check matrices (PCMs) are used to define linear error correcting ...
research
03/19/2022

Bounds on Unique-Neighbor Codes

Let A be an m× n parity check matrix of a binary code of length n, rate ...
research
06/16/2021

Low-Rank Parity-Check Codes Over Finite Commutative Rings and Application to Cryptography

Low-Rank Parity-Check (LRPC) codes are a class of rank metric codes that...

Please sign up or login with your details

Forgot password? Click here to reset