Pith. sign in

REVIEW 2 cited by

A RM-Polar 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 1407.5483 v1 pith:DNP47QJO submitted 2014-07-21 cs.IT math.IT

Bin Li , Hui Shen , David Tse This is my paper · ORCID
classification cs.ITmath.IT
keywords codescodepolarmuchrm-polarbettercalledcombining
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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, therefore it has much better error performance than Polar codes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. BiD Codes: Algebraic Codes from $3 \times 3$ Kernel

    cs.IT 2025-07 conditional novelty 7.0 of 10

    BiD codes, built from a 3x3 Kronecker kernel, have proven minimum distance growing at least as N^0.543 at any fixed rate, faster than Reed-Muller's N^0.5.

  2. 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