English
Related papers

Related papers: Low Rate Protograph-Based LDPC Codes for Continuou…

200 papers

Quantum low-density parity-check (QLDPC) codes are among the most promising candidates for future quantum error correction schemes. However, a limited number of short to moderate-length QLDPC codes have been designed and their decoding…

Information Theory · Computer Science 2024-05-07 Sisi Miao , Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

We propose a method for modifying orthogonal sparse matrix pairs used in CSS codes while preserving their matrix row and column weight distributions, which play a crucial role in determining the performance of belief-propagation decoding.…

Quantum Physics · Physics 2025-11-07 Koki Okada , Kenta Kasai

Non-Gaussian modulation can improve the performance of continuous-variable quantum key distribution (CV-QKD). For Gaussian modulated coherent state CV-QKD, photon subtraction can realize non-Gaussian modulation, which can be equivalently…

Quantum Physics · Physics 2023-05-04 Xiangyu Wang , Menghao Xu , Yin Zhao , Ziyang Chen , Song Yu , Hong Guo

Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from…

Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to generally as quantum low-density parity-check (QLDPC) codes --…

Quantum Physics · Physics 2025-10-20 Bane Vasic , Valentin Savin , Michele Pacenti , Shantom Borah , Nithin Raveendran

Continuous-variable quantum key distribution (CV-QKD) has been proposed as a method for securely exchanging keys to protect against the security concerns caused by potential advancements in quantum computing. In addition to optical fibre…

In this paper, we introduce a reconciliation protocol with a two-step error correction scheme that uses a short-blocklength, low-rate code and a long-blocklength, high-rate code. We simulate the protocol using a short-block-length…

In theory, quantum key distribution (QKD) provides unconditional security; however, its practical implementations are susceptible to exploitable vulnerabilities. This investigation tackles the constraints in practical QKD implementations…

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical…

Quantum Physics · Physics 2025-08-08 Shouzhen Gu , Mehdi Soleimanifar

Quantum low-density parity-check (QLDPC) codes have been proven to achieve higher minimum distances at higher code rates than surface codes. However, this family of codes imposes stringent latency requirements and poor performance under…

Information Theory · Computer Science 2024-06-26 Dimitris Chytas , Nithin Raveendran , Bane Vasić

This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum…

Information Theory · Computer Science 2012-08-28 Yuichiro Fujiwara , David Clark , Peter Vandendriessche , Maarten De Boeck , Vladimir D. Tonchev

This work investigates protograph-based LDPC codes for the AWGN channel with OOK modulation. A non-uniform distribution of the OOK modulation symbols is considered to improve the power efficiency especially for low SNRs. To this end, a…

Information Theory · Computer Science 2019-01-11 Alexandru Dominic Git , Balázs Matuz , Fabian Steiner

We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial time. Previous constructions of list decodable good distance…

Information Theory · Computer Science 2024-11-08 Thiago Bergamaschi , Fernando Granha Jeronimo , Tushant Mittal , Shashank Srivastava , Madhur Tulsiani

This paper considers the problem of source coding with side information at the decoder, also called Slepian-Wolf source coding scheme. In practical applications of this coding scheme, the statistical relation between the source and the side…

Information Theory · Computer Science 2018-08-21 Fangping Ye , Elsa Dupraz , Zeina Mheich , Karine Amis

This paper proposes a method for designing error correction codes by combining a known coding scheme with an autoencoder. Specifically, we integrate an LDPC code with a trained autoencoder to develop an error correction code for intractable…

Information Theory · Computer Science 2020-03-03 Eren Balevi , Jeffrey G. Andrews

Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear…

Quantum Physics · Physics 2022-06-15 Shouzhen Gu , Christopher A. Pattison , Eugene Tang

Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…

Quantum Physics · Physics 2012-07-04 Jacob Farinholt

Quantum Key Distribution (QKD) is a pivotal technology in the quest for secure communication, harnessing the power of quantum mechanics to ensure robust data protection. However, scaling QKD to meet the demands of high-speed, real-world…

Quantum Physics · Physics 2024-09-13 Hasan Abbas Al-Mohammed , Saif Al-Kuwari , Hashir Kuniyil , Ahmed Farouk

This paper propose a decoder architecture for low-density parity-check convolutional code (LDPCCC). Specifically, the LDPCCC is derived from a quasi-cyclic (QC) LDPC block code. By making use of the quasi-cyclic structure, the proposed…

Information Theory · Computer Science 2016-11-17 Chiu-Wing Sham , Xu Chen , Francis C. M. Lau , Yue Zhao , Wai M. Tam

We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing…

Information Theory · Computer Science 2016-11-18 Jaehong Kim , Aditya Ramamoorthy , Steven W. McLaughlin
‹ Prev 1 3 4 5 6 7 10 Next ›