Low Row Rank Parity Check Codes

TL;DR

This paper introduces low row rank parity check codes, an extension of LRPC codes, expanding the family of such codes and analyzing their decoding methods for potential cryptographic applications.

Contribution

It presents a new superfamily of LRPC codes called low row rank parity check codes and investigates their decoding techniques.

Findings

Established the existence of a superfamily of LRPC codes.

Analyzed the decoding methods for the new codes.

Extended the applicability of LRPC codes in cryptography.

Abstract

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.