{"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/deep-learning-for-joint-source-channel-coding","title":"Deep Learning for Joint Source-Channel Coding of Text","arxiv_id":"1802.06832","date":"2018-02-19","proceeding":null,"authors":["Nariman Farsad","Milind Rao","Andrea Goldsmith"],"abstract":"We consider the problem of joint source and channel coding of structured data\nsuch as natural language over a noisy channel. The typical approach to this\nproblem in both theory and practice involves performing source coding to first\ncompress the text and then channel coding to add robustness for the\ntransmission across the channel. This approach is optimal in terms of\nminimizing end-to-end distortion with arbitrarily large block lengths of both\nthe source and channel codes when transmission is over discrete memoryless\nchannels. However, the optimality of this approach is no longer ensured for\ndocuments of finite length and limitations on the length of the encoding. We\nwill show in this scenario that we can achieve lower word error rates by\ndeveloping a deep learning based encoder and decoder. While the approach of\nseparate source and channel coding would minimize bit error rates, our approach\npreserves semantic information of sentences by first embedding sentences in a\nsemantic space where sentences closer in meaning are located closer together,\nand then performing joint source and channel coding on these embeddings.","url_abs":"http://arxiv.org/abs/1802.06832v1","url_pdf":"http://arxiv.org/pdf/1802.06832v1.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-for-joint-source-channel-coding","repo_url":"https://github.com/milindmrao/nlp_comm","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"milindmrao/nlp_comm","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":"76593b3fdb486b7d49d1faa0690025ecd57a677889795a9b638f1c7e52727e18","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}