English
Related papers

Related papers: On the Minimum Distance of Array-Based Spatially-C…

200 papers

We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary…

Information Theory · Computer Science 2007-07-16 Axel Kohnert

To address the challenge of constructing short girth-8 quasi-cyclic (QC) low-density parity-check (LDPC) codes, a novel construction framework based on vertical symmetry (VS) is proposed. Basic properties of the VS structure are presented.…

Information Theory · Computer Science 2024-04-24 Guohua Zhang , Aijing Sun , Ling Liu , Yi Fang

This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying…

Information Theory · Computer Science 2016-11-17 Peyman Razaghi , Wei Yu

In this paper, we propose a new design method of irregular spatially-coupled low-density parity-check (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Jong-Seon No , Hosung Park

Quantum low-density parity-check (qLDPC) codes are quantum stabilizer codes where each stabilizer acts on a constant number of qubits and each qubit is acted on by a constant number of stabilizers. We study qLDPC codes constructed from…

Quantum Physics · Physics 2022-03-08 Ting-Chun Lin , Min-Hsiu Hsieh

Controlling small size trapping sets and short cycles can result in LDPC codes with large minimum distance $d_{\min}$. We prove that short cycles with a chord are the root of several trapping sets and eliminating these cycles increases…

Information Theory · Computer Science 2020-08-05 Farzane Amirzade , Mohammad-Reza~Sadeghi , Daniel Panario

We establish a connection between linear complementary dual (LCD) codes and caps in projective space. Using this framework and the structure theory of maximal caps, we derive nonexistence theorems for LCD codes with minimum distance at…

Information Theory · Computer Science 2026-04-07 Keita Ishizuka , Yuhi Kamio

In this paper, the application of non-binary low-density parity-check (NBLDPC) codes to MIMO systems which employ hundreds of antennas at both the transmitter and the receiver has been proposed. Together with the well-known low-complexity…

Information Theory · Computer Science 2012-11-22 Puripong Suthisopapan , Kenta Kasai , Anupap Meesomboon , Virasit Imtawil

The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices…

Information Theory · Computer Science 2013-02-05 Mohammad-Reza Sadeghi , Amin Sakzad

We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain $(\mathbb{F}_2^{m\times m})^V \quad \xrightarrow{\delta^0}\quad…

Quantum Physics · Physics 2022-06-17 Irit Dinur , Min-Hsiu Hsieh , Ting-Chun Lin , Thomas Vidick

We present a linked-cluster technique for calculating the distance of a quantum LDPC code. It offers an advantage over existing deterministic techniques for codes with small relative distances (which includes all known families of quantum…

Quantum Physics · Physics 2013-02-08 Alexey A. Kovalev , Ilya Dumer , Leonid P. Pryadko

We consider spatially coupled low-density parity-check (SC-LDPC) codes within a non-orthogonal interleave division multiple access (IDMA) scheme to avoid cumbersome degree profile matching of the LDPC code components to the iterative…

Information Theory · Computer Science 2019-01-29 Sebastian Cammerer , Xiaojie Wang , Yingyan Ma , Stephan ten Brink

Joint encryption-encoding schemes have been released to fulfill both reliability and security desires in a single step. Using Low Density Parity Check (LDPC) codes in joint encryption-encoding schemes, as an alternative to classical linear…

Information Theory · Computer Science 2019-02-22 Hossein Khayami , Taraneh Eghlidos , Mohammad Reza Aref

This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Zm and binary low-density parity-check (LDPC) codes, assuming belief propagation decoding on memoryless channels. A concrete framework is presented,…

Information Theory · Computer Science 2007-07-13 Chih-Chun Wang , Sanjeev R. Kulkarni , H. Vincent Poor

Most existing works on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assume that the degree distributions of the two ends of a randomly selected edge are independent. In the paper, we take one step…

Information Theory · Computer Science 2023-04-20 Hsiao-Wen Yu , Cheng-En Lee , Ruhui Zhang , Cheng-Shang Chang , Duan-Shin Lee

The concept and existence of sphere-bound-achieving and capacity-achieving lattices has been explained on AWGN channels by Forney. LDPC lattices, introduced by Sadeghi, perform very well under iterative decoding algorithm. In this work, we…

Information Theory · Computer Science 2012-04-12 Mohammad-Reza Sadeghi , Amin Sakzad

Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer…

Quantum Physics · Physics 2026-01-28 Fuchuan Wei , Zhengyi Han , Austin Yubo He , Zimu Li , Zi-Wen Liu

In this paper, a construction of a pair of "regular" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our…

Quantum Physics · Physics 2016-11-18 Manabu Hagiwara , Hideki Imai

Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of the BP, ML and near-ML decoding over a BEC and an AWGN channel…

Information Theory · Computer Science 2017-07-05 Irina E. Bocharova , Boris D. Kudryashov , Vitaly Skachek , Yauhen Yakimenka

In this paper, we investigate novel strategies for generating rate-compatible (RC) irregular low-density parity-check (LDPC) codes with short/moderate block lengths. We propose three puncturing and two extension schemes, which are designed…

Information Theory · Computer Science 2014-07-22 J. Liu , R. C. de Lamare