{"id":"https://openalex.org/W2148912087","doi":"https://doi.org/10.1109/isit.2009.5205648","title":"Quantum LDPC codes with positive rate and minimum distance proportional to n<sup>½</sup>","display_name":"Quantum LDPC codes with positive rate and minimum distance proportional to n<sup>½</sup>","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2148912087","doi":"https://doi.org/10.1109/isit.2009.5205648","mag":"2148912087"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205648","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205648","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"preprint","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/A5060302693","display_name":"Jean\u2013Pierre Tillich","orcid":"https://orcid.org/0000-0002-1709-1792"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN","FR"],"is_corresponding":true,"raw_author_name":"Jean-Pierre Tillich","raw_affiliation_strings":["Projet Secret, INRIA, Le Chesnay, France","Security, Cryptology and Transmissions"],"affiliations":[{"raw_affiliation_string":"Projet Secret, INRIA, Le Chesnay, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Security, Cryptology and Transmissions","institution_ids":["https://openalex.org/I4210132990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064676731","display_name":"Gilles Z\u00e9mor","orcid":"https://orcid.org/0000-0002-6041-9554"},"institutions":[{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gilles Zemor","raw_affiliation_strings":["Institut de Math\u00e9matiques de Bordeaux, Universit\u00e9 Bordeaux 1, Talence, France","Institut de Math\u00e9matiques de Bordeaux"],"affiliations":[{"raw_affiliation_string":"Institut de Math\u00e9matiques de Bordeaux, Universit\u00e9 Bordeaux 1, Talence, France","institution_ids":["https://openalex.org/I4210166017"]},{"raw_affiliation_string":"Institut de Math\u00e9matiques de Bordeaux","institution_ids":["https://openalex.org/I4210166017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060302693"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210132990"],"apc_list":null,"apc_paid":null,"fwci":3.1614,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.9245721,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"799","last_page":"803"},"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.9998999834060669,"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.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9983000159263611,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9835000038146973,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7657871842384338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6138197183609009},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5884168744087219},{"id":"https://openalex.org/keywords/square-root","display_name":"Square root","score":0.5320882201194763},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.49860286712646484},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.49232470989227295},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4598217308521271},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45676589012145996},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44683602452278137},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4436378479003906},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.4365059435367584},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.43119585514068604},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.3038116693496704},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.26394370198249817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1956045925617218},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.11471870541572571},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09438076615333557},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0608784556388855}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7657871842384338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6138197183609009},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5884168744087219},{"id":"https://openalex.org/C11577676","wikidata":"https://www.wikidata.org/wiki/Q134237","display_name":"Square root","level":2,"score":0.5320882201194763},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.49860286712646484},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.49232470989227295},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4598217308521271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45676589012145996},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44683602452278137},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4436378479003906},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.4365059435367584},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.43119585514068604},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.3038116693496704},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.26394370198249817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1956045925617218},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.11471870541572571},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09438076615333557},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0608784556388855},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2009.5205648","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205648","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00776266v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00776266","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Symposium on Information Theory, ISIT 2009, 2009, Seoul, South Korea. pp.799--804, ⟨10.1109/ISIT.2009.5205648⟩","raw_type":"Conference papers"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/115186","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/115186","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the IEEE Symposium on Information Theory, ISIT 2009","raw_type":"Communication dans un congr\u00e8s avec actes"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/189704","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/189704","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the IEEE Symposium on Information Theory, ISIT 2009","raw_type":"Communication dans un congr\u00e8s"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W291951","https://openalex.org/W280079156","https://openalex.org/W1481099449","https://openalex.org/W1485431007","https://openalex.org/W1531594186","https://openalex.org/W1579786114","https://openalex.org/W1608621648","https://openalex.org/W1632544105","https://openalex.org/W1658351531","https://openalex.org/W1850344377","https://openalex.org/W1970912697","https://openalex.org/W1975088395","https://openalex.org/W2003797908","https://openalex.org/W2009989296","https://openalex.org/W2102775931","https://openalex.org/W2103532256","https://openalex.org/W2114207424","https://openalex.org/W2119314900","https://openalex.org/W2124800360","https://openalex.org/W2128765501","https://openalex.org/W2131690084","https://openalex.org/W2135273380","https://openalex.org/W2137160281","https://openalex.org/W2145121981","https://openalex.org/W2149323415","https://openalex.org/W2226924098","https://openalex.org/W2293231900","https://openalex.org/W2600514646","https://openalex.org/W3098052888","https://openalex.org/W3100206575","https://openalex.org/W3103386480","https://openalex.org/W3104890871","https://openalex.org/W3105943350","https://openalex.org/W4210453336","https://openalex.org/W4300188436","https://openalex.org/W6636379515","https://openalex.org/W6689278888"],"related_works":["https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2003747419","https://openalex.org/W2540115800","https://openalex.org/W2167713507","https://openalex.org/W2034110706","https://openalex.org/W1975727149","https://openalex.org/W2103071251","https://openalex.org/W2093846049","https://openalex.org/W2086661663"],"abstract_inverted_index":{"The":[0],"current":[1],"best":[2],"asymptotic":[3],"lower":[4],"bound":[5],"on":[6],"the":[7,21,42,46],"minimum":[8,37],"distance":[9,38],"of":[10,45],"quantum":[11,26],"LDPC":[12,27],"codes":[13,28],"with":[14,29],"fixed":[15,30],"non-zero":[16,31],"rate":[17,32],"is":[18],"logarithmic":[19],"in":[20],"block":[22,47],"length.":[23,48],"We":[24],"build":[25],"and":[33],"prove":[34],"that":[35],"their":[36],"grows":[39],"proportionally":[40],"to":[41],"square":[43],"root":[44]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}