{"id":"https://openalex.org/W2115550046","doi":"https://doi.org/10.1109/isit.2009.5205787","title":"Rank q-cyclic and pseudo-q-cyclic codes","display_name":"Rank q-cyclic and pseudo-q-cyclic codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2115550046","doi":"https://doi.org/10.1109/isit.2009.5205787","mag":"2115550046"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205787","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":"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/A5058481417","display_name":"E.M. Gabidulin","orcid":null},"institutions":[{"id":"https://openalex.org/I153845743","display_name":"Moscow Institute of Physics and Technology","ror":"https://ror.org/00v0z9322","country_code":"RU","type":"education","lineage":["https://openalex.org/I153845743"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Ernst M. Gabidulin","raw_affiliation_strings":["Department of Electrical Engineering, Moscow Institute of Physics and Technology, Moscow, Russia","Department of Electrical Engineering, Moscow Institute of Physics and Technology (State University), 141700 Dolgoprudny, Moscow region, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Moscow Institute of Physics and Technology, Moscow, Russia","institution_ids":["https://openalex.org/I153845743"]},{"raw_affiliation_string":"Department of Electrical Engineering, Moscow Institute of Physics and Technology (State University), 141700 Dolgoprudny, Moscow region, Russia","institution_ids":["https://openalex.org/I153845743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058481417"],"corresponding_institution_ids":["https://openalex.org/I153845743"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.12434925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"it 46","issue":null,"first_page":"2799","last_page":"2802"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9916999936103821,"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/T10849","display_name":"Finite Group Theory Research","score":0.9789000153541565,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.7463352680206299},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.6508697867393494},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6331622004508972},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.5993447303771973},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.5885164141654968},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5698638558387756},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.5385741591453552},{"id":"https://openalex.org/keywords/luby-transform-code","display_name":"Luby transform code","score":0.4922102987766266},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4876784086227417},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46296265721321106},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4624830186367035},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42087990045547485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2250426709651947},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20060032606124878},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.08532792329788208}],"concepts":[{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.7463352680206299},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.6508697867393494},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6331622004508972},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.5993447303771973},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.5885164141654968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5698638558387756},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.5385741591453552},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.4922102987766266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4876784086227417},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46296265721321106},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4624830186367035},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42087990045547485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2250426709651947},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20060032606124878},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.08532792329788208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205787","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1996310087","https://openalex.org/W2011881257","https://openalex.org/W2055060019","https://openalex.org/W2064759901","https://openalex.org/W2136571043","https://openalex.org/W2317565009","https://openalex.org/W2331005958","https://openalex.org/W4236047074"],"related_works":["https://openalex.org/W3045580795","https://openalex.org/W2041319252","https://openalex.org/W1966899942","https://openalex.org/W165186219","https://openalex.org/W4235655084","https://openalex.org/W77726617","https://openalex.org/W2115550046","https://openalex.org/W645598334","https://openalex.org/W1992135520","https://openalex.org/W2963297040"],"abstract_inverted_index":{"In":[0,56],"the":[1,29,38,50,61,84,91,98,108],"theory":[2,51],"of":[3,11,31,40,52,63,71,86,93,100,107],"codes":[4,12,20,35,65,76,88,96],"based":[5,54],"on":[6],"Hamming":[7],"metric,":[8],"three":[9],"classes":[10],"are":[13,47],"well":[14],"known:":[15],"cyclic":[16,19,34],"codes,":[17,72],"shortened":[18,33,74,94],"and":[21,66,77],"pseudo-cyclic":[22,42],"codes.":[23,43,55,79],"An":[24],"important":[25],"result":[26],"is":[27,81,104,113],"that":[28,83],"class":[30,39,85,92],"linear":[32,41],"coincides":[36,89],"with":[37,90],"No":[44],"similar":[45],"results":[46],"known":[48],"in":[49],"rank-metric":[53],"this":[57],"paper,":[58],"we":[59],"generalize":[60],"notion":[62],"q-cyclic":[64,75,95],"introduce":[67],"two":[68],"new":[69],"families":[70],"namely,":[73],"pseudo-q-cyclic":[78,87],"It":[80],"proved":[82],"if":[97],"number":[99],"positions":[101],"to":[102],"shorten":[103],"a":[105],"multiple":[106],"extension":[109],"degree.":[110],"The":[111],"problem":[112],"still":[114],"open":[115],"for":[116],"other":[117],"shortening.":[118]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}