Pith. sign in

REVIEW 1 cited by

Performance and Complexity of Sequential Decoding of PAC Codes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2012.04990 v2 pith:WZAJGMZP submitted 2020-12-09 cs.IT math.IT

Mohsen Moradi , Amir Mozammel , Kangjian Qin , Erdal Arikan This is my paper · ORCID
classification cs.ITmath.IT
keywords codescomplexitydecodingperformancesequentialconvolutionalboundingcomparison
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity comparison of PAC codes with 5G polar codes and convolutional codes is given. A method for bounding the complexity of sequential decoding of PAC codes is proposed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design

    cs.IT 2024-12 conditional novelty 6.0 of 10

    Proves that PAC codes with rate profiles below polarized cutoff rates have Pareto-bounded sequential decoding complexity, and demonstrates a code built on this rule that gains over 0.75 dB at FER 1e-5.

Pith tools