{"id":"https://openalex.org/W2110207229","doi":"https://doi.org/10.1109/isit.2008.4595010","title":"Subsystem code constructions","display_name":"Subsystem code constructions","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2110207229","doi":"https://doi.org/10.1109/isit.2008.4595010","mag":"2110207229"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4595010","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","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/A5109039312","display_name":"Salah A. Aly","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Salah A. Aly","raw_affiliation_strings":["Department of Computer Science, Texas A and M University, College Station, TX, USA","Department of Computer Science, Texas A&M University College Station, TX#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science, Texas A&M University College Station, TX#TAB#","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018681725","display_name":"Andreas Klappenecker","orcid":"https://orcid.org/0000-0002-9882-2015"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andreas Klappenecker","raw_affiliation_strings":["Department of Computer Science, Texas A and M University, College Station, TX, USA","Department of Computer Science, Texas A&M University College Station, TX#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science, Texas A&M University College Station, TX#TAB#","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109039312"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":7.0246,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.96619268,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"369","last_page":"373"},"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.9997000098228455,"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.9994000196456909,"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/computer-science","display_name":"Computer science","score":0.6373122930526733},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6219726204872131},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5804871916770935},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5641291737556458},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5402870178222656},{"id":"https://openalex.org/keywords/tensor-product","display_name":"Tensor product","score":0.504348635673523},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.46123433113098145},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43876874446868896},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.431138813495636},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3536871671676636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3410186469554901},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21631145477294922},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.14636904001235962},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.097540944814682},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07788947224617004}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6373122930526733},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6219726204872131},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5804871916770935},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5641291737556458},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5402870178222656},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.504348635673523},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.46123433113098145},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43876874446868896},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.431138813495636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3536871671676636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3410186469554901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21631145477294922},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.14636904001235962},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.097540944814682},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07788947224617004},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2008.4595010","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.249.1896","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.249.1896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0712.4321v2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.770.2414","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.770.2414","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0712.4321.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1541797978","https://openalex.org/W1974123702","https://openalex.org/W1989420631","https://openalex.org/W1999770545","https://openalex.org/W2017964195","https://openalex.org/W2044740152","https://openalex.org/W2069711632","https://openalex.org/W2076107177","https://openalex.org/W2079362532","https://openalex.org/W2083041493","https://openalex.org/W2095025840","https://openalex.org/W2110207229","https://openalex.org/W2128751442","https://openalex.org/W2131690084","https://openalex.org/W2139625432","https://openalex.org/W2162938940","https://openalex.org/W2167413626","https://openalex.org/W3037198800","https://openalex.org/W3100206575"],"related_works":["https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1968396483","https://openalex.org/W4297536019","https://openalex.org/W2950636389","https://openalex.org/W1534925464","https://openalex.org/W1975697476","https://openalex.org/W2151857680","https://openalex.org/W1798117689","https://openalex.org/W792671342"],"abstract_inverted_index":{"Subsystem":[0],"codes":[1,10,60,64,96,111,127],"are":[2,97,116,135],"the":[3,16,34,49,52,72,82],"most":[4],"versatile":[5],"class":[6],"of":[7,19,33,45,74,105,108],"quantum":[8,35],"error-correcting":[9],"known":[11,21],"to":[12,57,70,121,140],"date":[13],"that":[14,38,67,91,118,137],"combine":[15],"best":[17],"features":[18],"all":[20,92],"passive":[22],"and":[23,51,76,124],"active":[24],"error-control":[25],"schemes.":[26],"The":[27,103],"subsystem":[28,50,59,63,75,95,110,126,130,144,150],"code":[29,145],"is":[30,39,65,89,112],"a":[31,42,86,142],"subspace":[32],"state":[36],"space":[37],"decomposed":[40],"into":[41],"tensor":[43],"product":[44],"two":[46,148],"vector":[47],"spaces:":[48],"co-subsystem.":[53],"A":[54],"generic":[55],"method":[56],"derive":[58],"from":[61,99,128],"existing":[62],"given":[66,129,149],"allows":[68],"one":[69,120,139],"trade":[71],"dimensions":[73],"co-subsystem":[77],"while":[78],"maintaining":[79],"or":[80],"improving":[81],"minimum":[83],"distance.":[84],"As":[85],"consequence,":[87],"it":[88],"shown":[90],"pure":[93],"MDS":[94,100,109],"derived":[98,117,136],"stabilizer":[101],"codes.":[102,131,151],"existence":[104],"numerous":[106],"families":[107],"established.":[113],"Propagation":[114],"rules":[115,134],"allow":[119,138],"obtain":[122],"longer":[123],"shorter":[125],"Furthermore,":[132],"propagation":[133],"construct":[141],"new":[143],"by":[146],"combining":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}