{"id":"https://openalex.org/W2136280136","doi":"https://doi.org/10.1109/isit.2011.6034210","title":"Quantum cyclic code of length dividing p&lt;sup&gt;t&lt;/sup&gt; + 1","display_name":"Quantum cyclic code of length dividing p&lt;sup&gt;t&lt;/sup&gt; + 1","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2136280136","doi":"https://doi.org/10.1109/isit.2011.6034210","mag":"2136280136"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6034210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6034210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"type":"article","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/A5029552414","display_name":"Sagarmoy Dutta","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sagarmoy Dutta","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090691108","display_name":"Piyush P. Kurur","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["DE","IN"],"is_corresponding":false,"raw_author_name":"Piyush P Kurur","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India","Max-Planck Institut f\u00fcr Informatik, Saarbrucken, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Saarbrucken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029552414"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13050067,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"86","issue":null,"first_page":"648","last_page":"652"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"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":1.0,"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.9991000294685364,"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"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.9980000257492065,"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/bch-code","display_name":"BCH code","score":0.7283165454864502},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6330901980400085},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5615914463996887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.559209406375885},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5035251975059509},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.49416211247444153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49313610792160034},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43716543912887573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3248105049133301},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.27035021781921387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26417481899261475}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.7283165454864502},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6330901980400085},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5615914463996887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.559209406375885},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5035251975059509},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.49416211247444153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49313610792160034},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43716543912887573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3248105049133301},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.27035021781921387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26417481899261475},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2011.6034210","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6034210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1601493687","https://openalex.org/W1631356911","https://openalex.org/W1999706070","https://openalex.org/W2014706286","https://openalex.org/W2042474962","https://openalex.org/W2060887031","https://openalex.org/W2069711632","https://openalex.org/W2087256203","https://openalex.org/W2091331782","https://openalex.org/W2092938635","https://openalex.org/W2095755044","https://openalex.org/W2114207424","https://openalex.org/W2125419304","https://openalex.org/W2131690084","https://openalex.org/W2143438504","https://openalex.org/W2148225705","https://openalex.org/W2159823338","https://openalex.org/W2162938940","https://openalex.org/W2167413626","https://openalex.org/W2369389650","https://openalex.org/W2764347725","https://openalex.org/W2809548040","https://openalex.org/W3100206575","https://openalex.org/W4229826396","https://openalex.org/W4298841163","https://openalex.org/W6765033650","https://openalex.org/W6770759485"],"related_works":["https://openalex.org/W2912502034","https://openalex.org/W3028734320","https://openalex.org/W1995527419","https://openalex.org/W1976834495","https://openalex.org/W4242597560","https://openalex.org/W2521769401","https://openalex.org/W1968289971","https://openalex.org/W4300588357","https://openalex.org/W2035513039","https://openalex.org/W2129012564"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,67,81,116,160],"study":[4],"cyclic":[5,104],"stabiliser":[6,56,61],"codes":[7,31,35,57,66,105,158,193],"over":[8],"F":[9],"<sub":[10],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[11,18,92],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">p</sub>":[12],"of":[13,55,106,124,132,148,171,192],"length":[14,107],"dividing":[15],"p":[16,90],"<sup":[17,91],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">t</sup>":[19,93],"+":[20,94],"1":[21,95],"for":[22,36,84,96,113,186,200],"some":[23],"positive":[24],"integer":[25,86],"t.":[26],"We":[27,38,71,142],"call":[28],"these":[29],"t-Frobenius":[30],"or":[32],"just":[33],"Frobenius":[34,65,76,133,157],"short.":[37],"give":[39,117],"methods":[40],"to":[41,121,154,176],"construct":[42,122],"them":[43],"and":[44,166],"show":[45,82,143,167],"that":[46,83,88,144,159,168,194],"they":[47],"have":[48,68],"efficient":[49,202],"decoding":[50,203],"algorithms.":[51],"An":[52],"important":[53],"subclass":[54],"are":[58,101,195],"the":[59,110,137,145,156,163,169,181,187],"linear":[60,64,75,103,199],"codes.":[62,77],"For":[63],"stronger":[69],"results:":[70],"completely":[72],"characterise":[73],"all":[74,123,155],"As":[78],"a":[79,190],"consequence,":[80],"every":[85],"n":[87],"divides":[89],"an":[97,118],"odd":[98],"t,":[99,115],"there":[100],"no":[102],"n.":[108],"On":[109],"other":[111],"hand":[112],"even":[114],"explicit":[119,130],"method":[120],"them.":[125],"This":[126,184],"gives":[127],"us":[128],"many":[129],"examples":[131],"code":[134],"which":[135,201],"include":[136],"well":[138],"studied":[139],"Laflamme":[140],"code.":[141],"classical":[146],"notion":[147],"BCH":[149,182],"distance":[150],"can":[151,173],"be":[152,174],"generalised":[153,175],"construct,":[161],"including":[162],"non-linear":[164],"ones,":[165],"algorithm":[170,204],"Berlekamp":[172],"correct":[177],"quantum":[178],"errors":[179],"within":[180],"limit.":[183],"gives,":[185],"first":[188],"time,":[189],"family":[191],"neither":[196],"CSS":[197],"nor":[198],"exits.":[205]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}