{"id":"https://openalex.org/W2743327613","doi":"https://doi.org/10.1109/isit.2017.8007100","title":"A new approach for constructing and decoding maximum rank distance codes","display_name":"A new approach for constructing and decoding maximum rank distance codes","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2743327613","doi":"https://doi.org/10.1109/isit.2017.8007100","mag":"2743327613"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8007100","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056299839"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09962723,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"3100","last_page":"3104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","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/T11130","display_name":"Coding theory and cryptography","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5925498604774475},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5892102718353271},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5509055852890015},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46541643142700195},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.43752869963645935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4329947829246521},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4316410422325134},{"id":"https://openalex.org/keywords/dual-code","display_name":"Dual code","score":0.41076505184173584},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40818506479263306},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.38228175044059753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3686063289642334},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3538970947265625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31499266624450684},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10502555966377258},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.06966006755828857}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5925498604774475},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5892102718353271},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5509055852890015},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46541643142700195},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.43752869963645935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4329947829246521},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4316410422325134},{"id":"https://openalex.org/C73666251","wikidata":"https://www.wikidata.org/wiki/Q5310189","display_name":"Dual code","level":5,"score":0.41076505184173584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40818506479263306},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.38228175044059753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3686063289642334},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3538970947265625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31499266624450684},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10502555966377258},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.06966006755828857},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8007100","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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":18,"referenced_works":["https://openalex.org/W129012938","https://openalex.org/W1662906987","https://openalex.org/W1964728727","https://openalex.org/W1980389767","https://openalex.org/W1993359877","https://openalex.org/W2025108828","https://openalex.org/W2055060019","https://openalex.org/W2060439883","https://openalex.org/W2095547380","https://openalex.org/W2098125062","https://openalex.org/W2118040894","https://openalex.org/W2136571043","https://openalex.org/W2139416652","https://openalex.org/W2323514020","https://openalex.org/W2556304964","https://openalex.org/W2963297998","https://openalex.org/W3099148554","https://openalex.org/W6656794346"],"related_works":["https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2113911300","https://openalex.org/W2151857680","https://openalex.org/W4386066307","https://openalex.org/W832867880","https://openalex.org/W917159298","https://openalex.org/W1975697476","https://openalex.org/W3136820369"],"abstract_inverted_index":{"A":[0],"rank-metric":[1,33,119],"code":[2,67,74],"is":[3,21,68,150,159],"a":[4,22,28,46,71],"subset":[5],"of":[6,31,45,53,75,126,143],"F":[7,17,60,79,100],"<sub":[8,18,61,80,101],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[9,12,19,62,81,102],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">q</sub>":[10,20,63,82,103],"<sup":[11],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n":[13],"\u00d7":[14],"m</sup>":[15],"where":[16,65],"finite":[23],"field.":[24],"Gabidulin":[25,54],"codes":[26,34,55,120,125,145],"are":[27,137],"well-known":[29],"class":[30],"algebraic":[32],"that":[35,178],"meet":[36],"the":[37,41,57,66,85,130,140],"Singleton":[38],"bound":[39],"on":[40,139],"minimum":[42,141],"rank":[43,155],"distance":[44,142,156],"code.":[47],"The":[48],"construction,":[49],"encoding,":[50],"and":[51,94,117,146],"decoding":[52,118],"use":[56],"extension":[58],"field":[59,97,132],"m,":[64],"regarded":[69],"as":[70],"linear":[72,124],"block":[73],"length":[76,127],"n":[77],"over":[78,99,129],"m.":[83,182],"However,":[84],"parameter":[86],"m":[87,104],"can":[88,105],"be":[89],"large":[90],"in":[91],"certain":[92],"applications":[93],"therefore,":[95],"performing":[96],"operations":[98],"become":[106],"very":[107],"complex.":[108],"In":[109],"this":[110],"paper,":[111],"we":[112],"investigate":[113],"methods":[114],"for":[115,167],"constructing":[116],"by":[121],"looking":[122],"into":[123],"nm":[128],"base":[131],"Fq.":[133],"Random":[134],"coding":[135],"bounds":[136],"derived":[138],"such":[144],"an":[147],"explicit":[148],"structure":[149],"demonstrated":[151],"to":[152,162],"construct":[153,163],"maximum":[154],"codes.":[157],"It":[158],"shown":[160],"how":[161],"sparse":[164],"parity-check":[165],"matrices":[166],"these":[168],"structures":[169],"which":[170],"enables":[171],"low":[172],"complexity":[173,177],"parallelized":[174],"decoders":[175],"with":[176,181],"scales":[179],"linearly":[180]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}