Learning to Decode Linear Codes Using Deep Learning

July 16, 2016 ยท Declared Dead ยท ๐Ÿ› Allerton Conference on Communication, Control, and Computing

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Eliya Nachmani, Yair Beery, David Burshtein arXiv ID 1607.04793 Category cs.IT: Information Theory Cross-listed cs.LG, cs.NE Citations 496 Venue Allerton Conference on Communication, Control, and Computing Last Checked 2 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Theory

Died the same way โ€” ๐Ÿ‘ป Ghosted