{"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/genetic-algorithm-based-polar-code","title":"Genetic Algorithm-based Polar Code Construction for the AWGN Channel","arxiv_id":"1901.06444","date":"2019-01-19","proceeding":null,"authors":["Ahmed Elkelesh","Moustafa Ebada","Sebastian Cammerer","Stephan ten Brink"],"abstract":"We propose a new polar code construction framework (i.e., selecting the\nfrozen bit positions) for the additive white Gaussian noise (AWGN) channel,\ntailored to a given decoding algorithm, rather than based on the (not\nnecessarily optimal) assumption of successive cancellation (SC) decoding. The\nproposed framework is based on the Genetic Algorithm (GenAlg), where\npopulations (i.e., collections) of information sets evolve successively via\nevolutionary transformations based on their individual error-rate performance.\nThese populations converge towards an information set that fits the decoding\nbehavior. Using our proposed algorithm, we construct a polar code of length\n2048 with code rate 0.5, without the CRC-aid, tailored to plain successive\ncancellation list (SCL) decoding, achieving the same error-rate performance as\nthe CRC-aided SCL decoding, and leading to a coding gain of 1 dB at BER of\n$10^{-6}$. Further, a belief propagation (BP)-tailored polar code approaches\nthe SCL error-rate performance without any modifications in the decoding\nalgorithm itself.","url_abs":"http://arxiv.org/abs/1901.06444v1","url_pdf":"http://arxiv.org/pdf/1901.06444v1.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":"genetic-algorithm-based-polar-code","repo_url":"https://github.com/AhmedElkelesh/Genetic-Algorithm-based-Polar-Code-Construction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"2048","task_name":"Playing the Game of 2048"}],"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":"AhmedElkelesh/Genetic-Algorithm-based-Polar-Code-Construction","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":"8c8d2de8bf0da701e165c4867399f172499264e4352555bb4b8cffcfad8ad1cc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}