English
Related papers

Related papers: A Joint Encryption-Encoding Scheme Using QC-LDPC C…

200 papers

We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based…

Cryptography and Security · Computer Science 2016-12-19 Carlos Aguilar , Olivier Blazy , Jean-Christophe Deneuville , Philippe Gaborit , Gilles Zémor

Given a Calderbank-Shor-Steane (CSS) code, it is sometimes necessary to modify the code by adding an arbitrary number of physical qubits and parity checks. Motivations may include concatenating codes, embedding low-density parity check…

Quantum Physics · Physics 2026-03-06 Andrew C. Yuan

High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are highly desirable for achieving fault-tolerant quantum computing. Recently, quantum error correction has experienced…

Quantum Physics · Physics 2025-01-31 Laura Pecorari , Sven Jandura , Gavin K. Brennen , Guido Pupillo

Generalized low-density parity-check (GLDPC) codes, where single parity-check (SPC) constraint nodes are replaced with generalized constraint (GC) nodes, are a promising class of codes for low latency communication. In this paper, a…

Information Theory · Computer Science 2019-10-16 Yanfang Liu , Pablo M. Olmos , David G. M. Mitchell

In order to protect intellectual property against untrusted foundry, many logic-locking schemes have been developed. The main idea of logic locking is to insert a key-controlled block into a circuit to make the circuit function incorrectly…

Hardware Architecture · Computer Science 2022-11-04 Jingbo Zhou , Xinmiao Zhang

This paper proposes a new method of constructing compact fully-connected Quasi-Cyclic Low Density Parity Check (QC-LDPC) codes with girth g = 8, 10, and 12. The originality of the proposed method is to impose constraints on the exponent…

Information Theory · Computer Science 2021-10-14 Alireza Tasdighi , Emmanuel Boutillon

We discuss and analyze a list-message-passing decoder with verification for low-density parity-check (LDPC) codes on the q-ary symmetric channel (q-SC). Rather than passing messages consisting of symbol probabilities, this decoder passes…

Information Theory · Computer Science 2015-03-13 Fan Zhang , Henry D. Pfister

In the practical continuous-variable quantum key distribution (CV-QKD) system, the postprocessing process, particularly the error correction part, significantly impacts the system performance. Multi-edge type low-density parity-check…

Quantum Physics · Physics 2021-04-26 Chao Zhou , Xiangyu Wang , Zhiguo Zhang , Song Yu , Ziyang Chen , Hong Guo

To alleviate the suboptimal performance of belief propagation (BP) decoding of short low-density parity-check (LDPC) codes, a plethora of improved decoding algorithms has been proposed over the last two decades. Many of these methods can be…

Information Theory · Computer Science 2024-11-01 Felix Krieg , Jannis Clausius , Marvin Geiselhart , Stephan ten Brink

In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition.…

Information Theory · Computer Science 2019-01-24 Jing Bai , Yongchao Wang , Francis C. M. Lau

Moderate Density Parity Check (MDPC) codes are defined here as codes which have a parity-check matrix whose row weight is $O(\sqrt{n})$ where $n$ is the length $n$ of the code. They can be decoded like LDPC codes but they decode much less…

Information Theory · Computer Science 2018-01-16 Jean-Pierre Tillich

Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived -- one based on nonprimitive narrow-sense BCH codes and the other directly…

Information Theory · Computer Science 2008-02-28 Salah A. Aly

A major challenge in fault-tolerant quantum computation (FTQC) is to reduce both space overhead -- the large number of physical qubits per logical qubit -- and time overhead -- the long physical gate sequences per logical gate. We prove…

Quantum Physics · Physics 2024-12-06 Shiro Tamiya , Masato Koashi , Hayata Yamasaki

A method to construct girth-12 (3,L) quasi-cyclic low-density parity-check (QC-LDPC) codes with all lengths larger than a certain given number is proposed, via a given girth-12 code subjected to some constraints. The lengths of these codes…

Information Theory · Computer Science 2010-01-25 Guohua Zhang , Xinmei Wang

This paper introduces a new approach to cost-effective, high-throughput hardware designs for Low Density Parity Check (LDPC) decoders. The proposed approach, called Non-Surjective Finite Alphabet Iterative Decoders (NS-FAIDs), exploits the…

Signal Processing · Electrical Eng. & Systems 2017-10-02 Thien Truong Nguyen-Ly , Valentin Savin , Khoa Le , David Declercq , Fakhreddine Ghaffari , Oana Boncalo

This paper considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to JD of…

Information Theory · Computer Science 2015-05-27 Byung-Hak Kim , Henry D. Pfister

Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…

Quantum Physics · Physics 2024-02-29 Benjamin J. Brown

This paper describes the design and C99 implementation of a free and open-source Low-Density Parity-Check (LDPC) codes encoder and decoder focused primarily on the Quasi-Cyclic LDPC (QCLDPC) codes utilized in the IEEE 802.11ax-2021 (Wi-Fi…

Information Theory · Computer Science 2023-06-22 Tomas Palenik , Viktor Szitkey

This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

This paper is concerned with construction and structural analysis of both cyclic and quasi-cyclic codes, particularly LDPC codes. It consists of three parts. The first part shows that a cyclic code given by a parity-check matrix in…

Information Theory · Computer Science 2010-12-16 Qin Huang , Qiuju Diao , Shu Lin , Khaled Abdel-Ghaffar