Pith. sign in

REVIEW 1 cited by

Learning to Decode Linear Codes Using 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 1607.04793 v2 pith:GFNNFLST submitted 2016-07-16 cs.IT cs.LGcs.NEmath.IT

classification cs.ITcs.LGcs.NEmath.IT
keywords algorithmbelieflearningpropagationpropertydeepmethodcodes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A novel deep learning method for improving the belief propagation algorithm is proposed. The method generalizes the standard belief propagation algorithm by assigning weights to the edges of the Tanner graph. These edges are then trained using deep learning techniques. A well-known property of the belief propagation algorithm is the independence of the performance on the transmitted codeword. A crucial property of our new method is that our decoder preserved this property. Furthermore, this property allows us to learn only a single codeword instead of exponential number of code-words. Improvements over the belief propagation algorithm are demonstrated for various high density parity check codes.

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. 5G LDPC Linear Transformer for Channel Decoding

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A linear-attention transformer decoder achieves bit error rate comparable to a standard transformer and better than one-iteration belief propagation on 5G NR LDPC codes, with O(n) instead of O(n^2) complexity.

Pith tools