{"id":"https://openalex.org/W2010547356","doi":"https://doi.org/10.1109/isit.2005.1523305","title":"On subcodes of codes in rank metric","display_name":"On subcodes of codes in rank metric","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2010547356","doi":"https://doi.org/10.1109/isit.2005.1523305","mag":"2010547356"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523305","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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":"E.M. Gabidulin","raw_affiliation_strings":["Moscow Institute of Physics and Technology, Dolgoprudny, Moscow Region, Russia"],"affiliations":[{"raw_affiliation_string":"Moscow Institute of Physics and Technology, Dolgoprudny, Moscow Region, Russia","institution_ids":["https://openalex.org/I153845743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021017945","display_name":"Pierre Loidreau","orcid":"https://orcid.org/0000-0002-7663-4662"},"institutions":[{"id":"https://openalex.org/I201181511","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es","ror":"https://ror.org/0309cs235","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"P. Loidreau","raw_affiliation_strings":["Ecole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es, Paris, France"],"affiliations":[{"raw_affiliation_string":"Ecole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es, Paris, France","institution_ids":["https://openalex.org/I201181511"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058481417"],"corresponding_institution_ids":["https://openalex.org/I153845743"],"apc_list":null,"apc_paid":null,"fwci":2.1937,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88716394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"121","last_page":"123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","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/T11130","display_name":"Coding theory and cryptography","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/T11797","display_name":"graph theory and CDMA systems","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9926999807357788,"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/rank","display_name":"Rank (graph theory)","score":0.7227836847305298},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6282122731208801},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5926560163497925},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5483409762382507},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4937766492366791},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4884864091873169},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.483318567276001},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4802241921424866},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4712429642677307},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4300769865512848},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4190980792045593},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.37621641159057617},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34918808937072754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32660984992980957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2984236776828766}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7227836847305298},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6282122731208801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5926560163497925},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5483409762382507},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4937766492366791},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4884864091873169},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.483318567276001},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4802241921424866},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4712429642677307},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4300769865512848},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4190980792045593},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.37621641159057617},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34918808937072754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32660984992980957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2984236776828766},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/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.2005.1523305","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1603678347","https://openalex.org/W1993359877","https://openalex.org/W2020484625","https://openalex.org/W2115216868","https://openalex.org/W2137760933","https://openalex.org/W2153823096","https://openalex.org/W2296108579","https://openalex.org/W6636330764"],"related_works":["https://openalex.org/W2139745099","https://openalex.org/W2127950068","https://openalex.org/W2015101254","https://openalex.org/W1782566311","https://openalex.org/W2114468163","https://openalex.org/W2132566027","https://openalex.org/W1989608637","https://openalex.org/W2209506458","https://openalex.org/W2140479584","https://openalex.org/W2169737172"],"abstract_inverted_index":{"Maximum":[0],"rank":[1,55,70],"distance":[2,56,71],"codes":[3,11,27,57,72,94],"are":[4],"the":[5,65,89,93],"equivalent":[6],"in":[7,61],"rank-metric":[8],"of":[9,25,53,68,73,92],"Reed-Solomon":[10],"whose":[12],"subcodes":[13,24,52],"have":[14],"been":[15],"widely":[16],"studied.":[17],"In":[18,44],"this":[19],"paper":[20],"we":[21,29,48],"characterize":[22],"subspace":[23],"MRD":[26],"and":[28,76],"show":[30,49],"that":[31,50],"it":[32],"is":[33],"possible":[34],"to":[35],"construct":[36],"efficient":[37],"polynomial-time":[38],"encoding-decoding":[39],"procedures":[40],"for":[41],"these":[42],"subcodes.":[43],"a":[45],"second":[46],"part":[47],"subfield":[51],"maximum":[54,69],"can":[58],"be":[59],"represented":[60],"some":[62,86],"sense":[63],"by":[64],"direct":[66],"sum":[67],"smaller":[74],"length":[75],"same":[77],"minimum":[78],"distance.":[79],"We":[80],"then":[81],"derive":[82],"an":[83],"algorithm":[84],"correcting":[85],"error-patterns":[87],"beyond":[88],"error-correcting":[90],"capability":[91]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}