{"id":"https://openalex.org/W2151819397","doi":"https://doi.org/10.1109/tit.2008.2006416","title":"Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction","display_name":"Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2151819397","doi":"https://doi.org/10.1109/tit.2008.2006416","mag":"2151819397"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2008.2006416","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2006416","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/quant-ph/0610195","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mitsuru Hamada","orcid":null},"institutions":[{"id":"https://openalex.org/I4210086780","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19","country_code":"JP","type":"government","lineage":["https://openalex.org/I4210086780"]},{"id":"https://openalex.org/I149481174","display_name":"Tamagawa University","ror":"https://ror.org/05f8a4p63","country_code":"JP","type":"education","lineage":["https://openalex.org/I149481174"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Mitsuru Hamada","raw_affiliation_strings":["PRESTO, Japan Science and Technology Agency, Kawaguchi, Saitama, Japan","Quantum Information Science Research Center, Tamagawa University Research Institute, Machida, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"PRESTO, Japan Science and Technology Agency, Kawaguchi, Saitama, Japan","institution_ids":["https://openalex.org/I4210086780"]},{"raw_affiliation_string":"Quantum Information Science Research Center, Tamagawa University Research Institute, Machida, Tokyo, Japan","institution_ids":["https://openalex.org/I149481174"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I149481174","https://openalex.org/I4210086780"],"apc_list":null,"apc_paid":null,"fwci":4.1061,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.93978712,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"54","issue":"12","first_page":"5689","last_page":"5704"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.968500018119812,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.968500018119812,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.005499999970197678,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.0038999998942017555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/polynomial","display_name":"Polynomial","score":0.5580999851226807},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5108000040054321},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.49709999561309814},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.43230000138282776},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.42410001158714294},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.41749998927116394},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3750999867916107},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.3734999895095825}],"concepts":[{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5580999851226807},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5108000040054321},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.49709999561309814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45350000262260437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43939998745918274},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.42410001158714294},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.41749998927116394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41690000891685486},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3734999895095825},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.3666999936103821},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3546000123023987},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.34940001368522644},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.3440000116825104},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.33559998869895935},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.32580000162124634},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.3179999887943268},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.28189998865127563},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.27140000462532043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26019999384880066},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.25769999623298645},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.25619998574256897}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2008.2006416","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2006416","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:quant-ph/0610195","is_oa":true,"landing_page_url":"http://arxiv.org/abs/quant-ph/0610195","pdf_url":"https://arxiv.org/pdf/quant-ph/0610195","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:quant-ph/0610195","is_oa":true,"landing_page_url":"http://arxiv.org/abs/quant-ph/0610195","pdf_url":"https://arxiv.org/pdf/quant-ph/0610195","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1560739689","https://openalex.org/W1965562276","https://openalex.org/W1992717794","https://openalex.org/W1993813188","https://openalex.org/W1996118782","https://openalex.org/W2037397342","https://openalex.org/W2043769961","https://openalex.org/W2044798361","https://openalex.org/W2069711632","https://openalex.org/W2071764857","https://openalex.org/W2091331782","https://openalex.org/W2091968255","https://openalex.org/W2092834040","https://openalex.org/W2105074092","https://openalex.org/W2108566865","https://openalex.org/W2112952018","https://openalex.org/W2114207424","https://openalex.org/W2115616752","https://openalex.org/W2119314900","https://openalex.org/W2131690084","https://openalex.org/W2135537429","https://openalex.org/W2136561839","https://openalex.org/W2141412822","https://openalex.org/W2143438504","https://openalex.org/W2159193690","https://openalex.org/W2161858440","https://openalex.org/W2167413626","https://openalex.org/W2296071142","https://openalex.org/W2534445923","https://openalex.org/W3144798926","https://openalex.org/W6637136361"],"related_works":[],"abstract_inverted_index":{"A":[0],"method":[1,10],"for":[2,81],"concatenating":[3],"quantum":[4,18],"error-correcting":[5,19],"codes":[6,20,29,74],"is":[7,11,50,79],"presented.":[8,47],"The":[9,48],"applicable":[12],"to":[13,56],"a":[14,27,32,82],"wide":[15,83],"class":[16],"of":[17,73],"known":[21,55,65],"as":[22],"Calderbank-Shor-Steane":[23],"(CSS)":[24],"codes.":[25,61],"As":[26],"result,":[28],"that":[30,40],"achieve":[31],"high":[33],"rate":[34,49],"in":[35,43,76],"the":[36,51,63,69],"Shannon-theoretic":[37],"sense":[38],"and":[39],"are":[41,46],"decodable":[42],"polynomial":[44,77],"time":[45,78],"highest":[52],"among":[53],"those":[54],"be":[57],"achievable":[58],"by":[59],"CSS":[60],"Moreover,":[62],"best":[64],"lower":[66],"bound":[67],"on":[68],"greatest":[70],"minimum":[71],"distance":[72],"constructible":[75],"improved":[80],"range.":[84]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2016-06-24T00:00:00"}