{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/deep-learning-methods-for-improved-decoding","title":"Deep Learning Methods for Improved Decoding of Linear Codes","arxiv_id":"1706.07043","date":"2017-06-21","proceeding":null,"authors":["Eliya Nachmani","Elad Marciano","Loren Lugosch","Warren J. Gross","David Burshtein","Yair Beery"],"abstract":"The problem of low complexity, close to optimal, channel decoding of linear\ncodes with short to moderate block length is considered. It is shown that deep\nlearning methods can be used to improve a standard belief propagation decoder,\ndespite the large example space. Similar improvements are obtained for the\nmin-sum algorithm. It is also shown that tying the parameters of the decoders\nacross iterations, so as to form a recurrent neural network architecture, can\nbe implemented with comparable results. The advantage is that significantly\nless parameters are required. We also introduce a recurrent neural decoder\narchitecture based on the method of successive relaxation. Improvements over\nstandard belief propagation are also observed on sparser Tanner graph\nrepresentations of the codes. Furthermore, we demonstrate that the neural\nbelief propagation decoder can be used to improve the performance, or\nalternatively reduce the computational complexity, of a close to optimal\ndecoder of short BCH codes.","url_abs":"http://arxiv.org/abs/1706.07043v2","url_pdf":"http://arxiv.org/pdf/1706.07043v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"deep-learning-methods-for-improved-decoding","repo_url":"https://github.com/lorenlugosch/neural-min-sum-decoding","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"deep-learning-methods-for-improved-decoding","repo_url":"https://github.com/NVlabs/sionna/blob/main/examples/Weighted_BP_Algorithm.ipynb","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1706.07043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.07043"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/NVlabs/sionna/blob/main/examples/Weighted_BP_Algorithm.ipynb","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/lorenlugosch/neural-min-sum-decoding","reach":null}],"summary":{"unverified":1},"by_repo_kind":{"listed":{"samples":1,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"samples":[{"code_sha256_prefix":"be0af4371e278f80","entry":"load_code","repo":"lorenlugosch/neural-min-sum-decoding","repo_kind":"listed","path":"helper_functions.py","file_url":"https://github.com/lorenlugosch/neural-min-sum-decoding/blob/HEAD/helper_functions.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"be0af4371e278f80"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}