{"corpus_id":7239775,"paper_sha":"e988a31af77cde2fa6603be624a6e65a3490b91e","doi":"10.1109/ITW.2013.6691213","arxiv_id":"1307.2352","pmid":null,"pmcid":null,"mag_id":2951756243,"dblp_id":"journals/corr/TrifonovM13","acl_id":null,"title":"Polar codes with dynamic frozen symbols and their decoding by directed search","year":2013,"publication_date":"2013-07-09","venue":"Information Theory Workshop","journal":{"name":"2013 IEEE Information Theory Workshop (ITW)","pages":"1-5","volume":null},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Mathematics","Computer Science"],"reference_count":12,"citation_count":95,"influential_citation_count":8,"is_open_access":true,"arxiv_categories":["cs.IT","math.IT"],"arxiv_license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"http://arxiv.org/pdf/1307.2352.pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/e988a31af77cde2fa6603be624a6e65a3490b91e","s2_open_access_license":null,"s2_open_access_status":"GREEN","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which employs estimates of the not-yet-processed bit channel error probabilities to perform directed search in code tree, reducing thus the total number of iterations.","claims":[{"public_id":"cl_d7a6f5af9b4e185bcb5b2244ed31b1ef","status":"active","text":"A decoding algorithm is proposed that uses estimates of the not-yet-processed bit-channel error probabilities to direct the search in the code tree.","confidence":0.98,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_d7a6f5af9b4e185bcb5b2244ed31b1ef"},{"public_id":"cl_d6f704a9d373a7969af147dc340c35dc","status":"active","text":"A novel construction of polar codes with dynamic frozen symbols is proposed.","confidence":0.99,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_d6f704a9d373a7969af147dc340c35dc"},{"public_id":"cl_ce297812290c5311f298496ad930773d","status":"active","text":"Directed search in the code tree reduces the total number of iterations.","confidence":0.93,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_ce297812290c5311f298496ad930773d"},{"public_id":"cl_987b2a05c64579d0c38c301721d16611","status":"active","text":"The proposed codes are subcodes of extended BCH codes, which provide sufficiently high minimum distance.","confidence":0.96,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_987b2a05c64579d0c38c301721d16611"}],"concepts":[{"public_id":"co_1478e9f365fd22212014ec3d4e435e47","status":"active","name":"minimum distance","description":"The smallest Hamming distance between distinct codewords, determining error-correction strength.","types":["code property"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_1478e9f365fd22212014ec3d4e435e47"},{"public_id":"co_4d0ee445e8d782e9561dd4fad9fe440b","status":"active","name":"extended BCH codes","description":"Extended Bose–Chaudhuri–Hocquenghem codes used here as a parent code family for the polar-code construction.","types":["error-correcting code"],"aliases":["eBCH codes","extended Bose-Chaudhuri-Hocquenghem codes"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_4d0ee445e8d782e9561dd4fad9fe440b"},{"public_id":"co_c089feb2de5f41700f266f4f8ddcdc8f","status":"active","name":"code tree","description":"A tree representation of candidate decoding paths explored during search.","types":["data structure"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_c089feb2de5f41700f266f4f8ddcdc8f"},{"public_id":"co_c65be88e6aa9fff0d91513f2d0a3a9d4","status":"active","name":"directed search","description":"A guided search strategy that prioritizes more promising branches in the code tree.","types":["search method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_c65be88e6aa9fff0d91513f2d0a3a9d4"},{"public_id":"co_d1569257c36ba5ff139de60f549b4177","status":"active","name":"total number of iterations","description":"The count of iterative steps required by the decoding procedure.","types":["performance measure"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_d1569257c36ba5ff139de60f549b4177"},{"public_id":"co_d628a2c13963a6c7c5cd1c4cd1bb3c4c","status":"active","name":"polar codes with dynamic frozen symbols","description":"A polar code construction that includes frozen symbols whose values can depend on other symbols.","types":["code construction"],"aliases":["dynamic frozen-symbol polar codes"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_d628a2c13963a6c7c5cd1c4cd1bb3c4c"},{"public_id":"co_e6002ba8b61e97ae6d303a751ceaf527","status":"active","name":"bit-channel error probabilities","description":"Estimated error probabilities associated with individual bit channels during polar decoding.","types":["probabilistic quantity"],"aliases":["bit channel error probabilities"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_e6002ba8b61e97ae6d303a751ceaf527"},{"public_id":"co_fb1e085d12711dd160354743a3955b60","status":"active","name":"decoding algorithm","description":"A procedure for decoding the proposed polar codes.","types":["method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_fb1e085d12711dd160354743a3955b60"}],"external_ids":{"DOI":"10.1109/ITW.2013.6691213","ArXiv":"1307.2352","PubMed":null,"PubMedCentral":null,"MAG":2951756243,"DBLP":"journals/corr/TrifonovM13","ACL":null},"open_access":{"is_open_access":true,"pdf_url":"http://arxiv.org/pdf/1307.2352.pdf","landing_url":"https://www.semanticscholar.org/paper/e988a31af77cde2fa6603be624a6e65a3490b91e","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":null,"status":"GREEN","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":true,"full_text_source":"arxiv","count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":634569,"paper_uid":"47004f9b-a429-45d5-9ddf-a453d39b4139","canonical_identity":{"paper_id":634569,"paper_uid":"47004f9b-a429-45d5-9ddf-a453d39b4139","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/7239775"}