English
Related papers

Related papers: Interpolation of Quantum Polar Codes and Quantum R…

200 papers

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM…

Information Theory · Computer Science 2014-09-04 Marco Mondelli , S. Hamed Hassani , Rüdiger Urbanke

Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such a problem. However, there is much to be done in the avenue of optimizing channel…

Information Theory · Computer Science 2022-06-22 Francisco Revson F. Pereira , Stefano Mancini

Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure by transmitting random bits that are encoded as qubits and sent over a quantum channel, followed by classical…

We study the use of polar codes for both discrete and continuous variables Quantum Key Distribution (QKD). Although very large blocks must be used to obtain the efficiency required by quantum key distribution, and especially continuous…

Quantum Physics · Physics 2013-07-30 Paul Jouguet , Sébastien Kunz-Jacques

Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and…

Information Theory · Computer Science 2018-07-12 Seyyed Ali Hashemi , Nghia Doan , Marco Mondelli , Warren J. Gross

We construct an explicit quantum coding scheme which achieves a communication rate not less than the coherent information when used to transmit quantum information over a noisy quantum channel. For Pauli and erasure channels we also present…

Quantum Physics · Physics 2015-12-10 Joseph M. Renes , David Sutter , Frédéric Dupuis , Renato Renner

Polar coding is a method for communication over noisy classical channels which is provably capacity-achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information…

Quantum Physics · Physics 2016-02-01 Christoph Hirche , Ciara Morgan , Mark M. Wilde

A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar…

Information Theory · Computer Science 2013-02-04 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

Long quantum codes using projective Reed-Muller codes are constructed. Projective Reed-Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum…

Information Theory · Computer Science 2025-03-03 Diego Ruano , Rodrigo San-José

Quantum key distribution (QKD) is a cryptographic system that generates an information-theoretically secure key shared by two legitimate parties. QKD consists of two parts: quantum and classical. The latter is referred to as classical…

Information Theory · Computer Science 2018-05-15 Sunghoon Lee , Jooyoun Park , Jun Heo

This paper considers the design and decoding of polar codes for general classical-quantum (CQ) channels. It focuses on decoding via belief-propagation with quantum messages (BPQM) and, in particular, the idea of paired-measurement BPQM…

Information Theory · Computer Science 2024-01-17 Avijit Mandal , S. Brandsen , Henry D. Pfister

A scheme for concatenating the recently invented polar codes with non-binary MDS codes, as Reed-Solomon codes, is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation…

Information Theory · Computer Science 2016-11-17 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacityachieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures…

Information Theory · Computer Science 2021-10-19 Kirill Ivanov , Rüdiger Urbanke

Concatenation of two quantum error correcting codes with complementary sets of transversal gates can provide a means towards universal fault-tolerant computation. We first show that it is generally preferable to choose the inner code with…

Quantum Physics · Physics 2017-08-18 Christopher Chamberland , Tomas Jochym-O'Connor

In this letter we propose a new hybrid code called "RM-Polar" codes. This new codes are constructed by combining the construction of Reed-Muller (RM) code and Polar code. It has much larger minimum Hamming distance than Polar codes,…

Information Theory · Computer Science 2014-07-22 Bin Li , Hui Shen , David Tse

Progress in designing channel codes has been driven by human ingenuity and, fittingly, has been sporadic. Polar codes, developed on the foundation of Arikan's polarization kernel, represent the latest breakthrough in coding theory and have…

Information Theory · Computer Science 2024-06-06 S Ashwin Hebbar , Sravan Kumar Ankireddy , Hyeji Kim , Sewoong Oh , Pramod Viswanath

Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems. One significant drawback, however, is that…

Information Theory · Computer Science 2010-01-15 Mayank Bakshi , Sidharth Jaggi , Michelle Effros

In this work, we present a concatenated repetition-polar coding scheme that is aimed at applications requiring highly unbalanced unequal bit-error protection, such as the Beam Interlock System of the Large Hadron Collider at CERN. Even…

Information Theory · Computer Science 2017-12-04 Alexios Balatsoukas-Stimming , Tomasz Podzorny , Jan Uythoven

A framework of monomial codes is considered, which includes linear codes generated by the evaluation of certain monomials. Polar and Reed-Muller codes are the two best-known representatives of such codes and can be considered as two extreme…

Information Theory · Computer Science 2021-02-08 Kirill Ivanov , Rüdiger Urbanke

Reed Muller (RM) codes are known for their good minimum distance. One can use their structure to construct polar-like codes with good distance properties by choosing the information set as the rows of the polarization matrix with the…

Information Theory · Computer Science 2022-04-15 Samet Gelincik , Philippe Mary , Anne Savard , Jean-Yves Baudais
‹ Prev 1 2 3 10 Next ›