{"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/deepcode-feedback-codes-via-deep-learning","title":"Deepcode: Feedback Codes via Deep Learning","arxiv_id":"1807.00801","date":"2018-07-02","proceeding":"NeurIPS 2018 12","authors":["Hyeji Kim","Yihan Jiang","Sreeram Kannan","Sewoong Oh","Pramod Viswanath"],"abstract":"The design of codes for communicating reliably over a statistically well\ndefined channel is an important endeavor involving deep mathematical research\nand wide-ranging practical applications. In this work, we present the first\nfamily of codes obtained via deep learning, which significantly beats\nstate-of-the-art codes designed over several decades of research. The\ncommunication channel under consideration is the Gaussian noise channel with\nfeedback, whose study was initiated by Shannon; feedback is known theoretically\nto improve reliability of communication, but no practical codes that do so have\never been successfully constructed.\n  We break this logjam by integrating information theoretic insights\nharmoniously with recurrent-neural-network based encoders and decoders to\ncreate novel codes that outperform known codes by 3 orders of magnitude in\nreliability. We also demonstrate several desirable properties of the codes: (a)\ngeneralization to larger block lengths, (b) composability with known codes, (c)\nadaptation to practical constraints. This result also has broader ramifications\nfor coding theory: even when the channel has a clear mathematical model, deep\nlearning methodologies, when combined with channel-specific\ninformation-theoretic insights, can potentially beat state-of-the-art codes\nconstructed over decades of mathematical research.","url_abs":"http://arxiv.org/abs/1807.00801v1","url_pdf":"http://arxiv.org/pdf/1807.00801v1.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":"deepcode-feedback-codes-via-deep-learning","repo_url":"https://github.com/hyejikim1/Deepcode","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1807.00801","atlas_url":"https://app.syntology.ai/?focus=1807.00801","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":"1807.00801"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1807.00801\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1807.00801"},"call":"get_concepts_for_paper(arxiv_id=\"1807.00801\")"}],"by_repo":[{"repo":"hyejikim1/Deepcode","kind":"official","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":"cfc0f5ff7f5ceb0534fc1087f70bdd3de9464b8815e060aea135a1a78ee03a7f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}