Pith. sign in

REVIEW 3 cited by

DeepPolar: Inventing Nonlinear Large-Kernel Polar Codes via Deep Learning

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 2402.08864 v2 pith:EVJQ6YK4 submitted 2024-02-14 cs.IT cs.LGmath.IT

classification cs.ITcs.LGmath.IT
keywords codespolardeeppolarkernelbeenchannelcodingconventional
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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 emerged as the state-of-the-art error-correction code for short-to-medium block length regimes. In an effort to automate the invention of good channel codes, especially in this regime, we explore a novel, non-linear generalization of Polar codes, which we call DeepPolar codes. DeepPolar codes extend the conventional Polar coding framework by utilizing a larger kernel size and parameterizing these kernels and matched decoders through neural networks. Our results demonstrate that these data-driven codes effectively leverage the benefits of a larger kernel size, resulting in enhanced reliability when compared to both existing neural codes and conventional Polar codes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. HiKO: A Hierarchical Framework for Beyond-Second-Order KO Codes

    cs.IT 2025-06 conditional novelty 6.0 of 10

    Hierarchical pretraining and progressive unfreezing let Kronecker-operation neural codes outperform Reed-Muller codes at orders r=3 and r=4 (block lengths 256 and 512), the first reported extension of KO codes beyond ...

  2. Actions Speak Louder Than Words: Rate-Reward Trade-off in Markov Decision Processes

    cs.IT 2025-02 conditional novelty 5.0 of 10

    For an MDP whose states are observed by a receiver, the capacity of communication through actions equals a conditional mutual information, and the rate-reward trade-off is a convex program; Act2Comm is a practical tra...

  3. DeepPolar+: Breaking the BER-BLER Trade-off with Self-Attention and SMART (SNR-MAtched Redundancy Technique) decoding

    cs.IT 2025-06 reject novelty 4.0 of 10

    An attention-based neural polar decoder with a block-level loss improves simulated BER and BLER for a (256,37) polar code, and a CRC-guided ensemble variant reports further gains.

Pith tools