Pith. sign in

REVIEW

Polar Codes and Their Quantum-Domain Counterparts

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1909.09200 v1 pith:4OI66WSK submitted 2019-09-01 cs.IT math.ITquant-ph

Polar Codes and Their Quantum-Domain Counterparts

classification cs.IT math.ITquant-ph
keywords codespolarquantumwellachievedachievingadaptationarikan
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Arikan's polar codes are capable of achieving the Shannon's capacity at a low encoding and decoding complexity, while inherently supporting rate adaptation. By virtue of these attractive features, polar codes have provided fierce competition to both the turbo as well as the Low Density Parity Check (LDPC) codes, making its way into the 5G New Radio (NR). Realizing the significance of polar codes, in this paper we provide a comprehensive survey of polar codes, highlighting the major milestones achieved in the last decade. Furthermore, we also provide tutorial insights into the polar encoder, decoders as well as the code construction methods. We also extend our discussions to quantum polar codes with an emphasis on the underlying quantum-to-classical isomorphism and the syndrome-based quantum polar codes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.