{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/communication-algorithms-via-deep-learning","title":"Communication Algorithms via Deep Learning","arxiv_id":"1805.09317","date":"2018-05-23","proceeding":"ICLR 2018 1","authors":["Hyeji Kim","Yihan Jiang","Ranvir Rana","Sreeram Kannan","Sewoong Oh","Pramod Viswanath"],"abstract":"Coding theory is a central discipline underpinning wireline and wireless\nmodems that are the workhorses of the information age. Progress in coding\ntheory is largely driven by individual human ingenuity with sporadic\nbreakthroughs over the past century. In this paper we study whether it is\npossible to automate the discovery of decoding algorithms via deep learning. We\nstudy a family of sequential codes parameterized by recurrent neural network\n(RNN) architectures. We show that creatively designed and trained RNN\narchitectures can decode well known sequential codes such as the convolutional\nand turbo codes with close to optimal performance on the additive white\nGaussian noise (AWGN) channel, which itself is achieved by breakthrough\nalgorithms of our times (Viterbi and BCJR decoders, representing dynamic\nprograming and forward-backward algorithms). We show strong generalizations,\ni.e., we train at a specific signal to noise ratio and block length but test at\na wide range of these quantities, as well as robustness and adaptivity to\ndeviations from the AWGN setting.","url_abs":"http://arxiv.org/abs/1805.09317v1","url_pdf":"http://arxiv.org/pdf/1805.09317v1.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":"communication-algorithms-via-deep-learning","repo_url":"https://github.com/yihanjiang/Sequential-RNN-Decoder","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"communication-algorithms-via-deep-learning","repo_url":"https://github.com/TCIPrime/turbo-nn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"communication-algorithms-via-deep-learning","repo_url":"https://github.com/datlife/deepcom","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"ingenuity","task_name":"Ingenuity"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.09317","atlas_url":"https://app.syntology.ai/?focus=1805.09317","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1805.09317"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.09317\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.09317"},"call":"get_concepts_for_paper(arxiv_id=\"1805.09317\")"}],"by_repo":[{"repo":"yihanjiang/Sequential-RNN-Decoder","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"TCIPrime/turbo-nn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"datlife/deepcom","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"19a730cc60ebf65885eebf4592f3aee34bb01df5b251efcc7e11917b27391e83","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}