{"id":"https://openalex.org/W2071934672","doi":"https://doi.org/10.1109/istc.2010.5613813","title":"Improving successive cancellation decoding of polar codes by usage of inner block codes","display_name":"Improving successive cancellation decoding of polar codes by usage of inner block codes","alternate_titles":[],"publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2071934672","doi":"https://doi.org/10.1109/istc.2010.5613813","mag":"2071934672"},"language":"en","primary_location":{"id":"doi:10.1109/istc.2010.5613813","doi":"https://doi.org/10.1109/istc.2010.5613813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2010.5613813","pdf_url":null,"source":{"id":"https://openalex.org/S4306420227","display_name":"International Symposium on Turbo Codes and Iterative Information Processing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 6th International Symposium on Turbo Codes &amp; Iterative Information Processing","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2071934672"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054815522","display_name":"Mathis Seidl","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Mathis Seidl","raw_affiliation_strings":["Lehrstuhl f\u00fcr Informations\u00fcbertragung, Universit\u00e4t Erlangen-N\u00fcrnberg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl f\u00fcr Informations\u00fcbertragung, Universit\u00e4t Erlangen-N\u00fcrnberg, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028217481","display_name":"Johannes B. Huber","orcid":"https://orcid.org/0000-0003-2586-5249","observed_orcids":["https://orcid.org/0000-0003-2586-5249"]},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Johannes B. Huber","raw_affiliation_strings":["Lehrstuhl f\u00fcr Informations\u00fcbertragung, Universit\u00e4t Erlangen-N\u00fcrnberg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl f\u00fcr Informations\u00fcbertragung, Universit\u00e4t Erlangen-N\u00fcrnberg, Germany","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":null,"apc_paid":null,"fwci":2.2094,"has_fulltext":false,"cited_by_count":46,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.88314756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"103","last_page":"106"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.00279999990016222,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polar-codes","display_name":"polar codes","score":0.9990000128746033},{"id":"https://openalex.org/keywords/successive-cancellation-decoding","display_name":"successive cancellation decoding","score":0.9990000128746033},{"id":"https://openalex.org/keywords/finite-length-performance","display_name":"finite-length performance","score":0.9620000123977661},{"id":"https://openalex.org/keywords/binary-input-discrete-memoryless-channels","display_name":"binary-input discrete memoryless channels","score":0.890999972820282},{"id":"https://openalex.org/keywords/capacity-achieving-codes","display_name":"capacity-achieving codes","score":0.8130000233650208},{"id":"https://openalex.org/keywords/iterative-decoding","display_name":"iterative decoding","score":0.4950000047683716}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7796269059181213},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.7154810428619385},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6484930515289307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6053411960601807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5799773335456848},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.5757371187210083},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5660398602485657},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5233009457588196},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4743589162826538},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4450042247772217},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.43220803141593933},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38003474473953247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2772562503814697},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20916080474853516},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08415129780769348},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06464892625808716},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06018134951591492},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istc.2010.5613813","doi":"https://doi.org/10.1109/istc.2010.5613813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2010.5613813","pdf_url":null,"source":{"id":"https://openalex.org/S4306420227","display_name":"International Symposium on Turbo Codes and Iterative Information Processing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 6th International Symposium on Turbo Codes &amp; Iterative Information Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W2101067964","https://openalex.org/W2131457481","https://openalex.org/W2150498905"],"related_works":["https://openalex.org/W2522694692","https://openalex.org/W2532025433","https://openalex.org/W2763873148","https://openalex.org/W4248033180","https://openalex.org/W2103443984","https://openalex.org/W2737501407","https://openalex.org/W963020091","https://openalex.org/W2117009122","https://openalex.org/W2975500163","https://openalex.org/W4327719381"],"abstract_inverted_index":{"Polar":[0],"coding":[1],"is":[2],"a":[3,17],"recently":[4],"introduced":[5],"capacity-achieving":[6],"code":[7],"constructing":[8],"method":[9,18],"for":[10],"binary-input":[11],"discrete":[12],"memoryless":[13],"channels.":[14],"We":[15],"present":[16],"to":[19],"improve":[20],"the":[21],"finite-length":[22],"performance":[23],"of":[24,35,47],"polar":[25],"codes":[26],"together":[27],"with":[28],"successive":[29],"cancellation":[30],"(SC)":[31],"decoding":[32],"by":[33],"means":[34],"simple":[36],"and":[37],"short":[38],"inner":[39],"block":[40],"codes.":[41],"Example":[42],"simulations":[43],"show":[44],"an":[45],"improvement":[46],"about":[48],"0.3":[49],"dB.":[50]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2071934672","counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
