{"id":"https://openalex.org/W3096146904","doi":"https://doi.org/10.1137/21m1428947","title":"Common Complements of Linear Subspaces and the Sparseness of MRD Codes","display_name":"Common Complements of Linear Subspaces and the Sparseness of MRD Codes","publication_year":2022,"publication_date":"2022-04-11","ids":{"openalex":"https://openalex.org/W3096146904","doi":"https://doi.org/10.1137/21m1428947","mag":"3096146904"},"language":"en","primary_location":{"id":"doi:10.1137/21m1428947","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1428947","pdf_url":null,"source":{"id":"https://openalex.org/S2996807011","display_name":"SIAM Journal on Applied Algebra and Geometry","issn_l":"2470-6566","issn":["2470-6566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Applied Algebra and Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/deaa6ad0-2625-474b-b3c2-b6651a90a1aa","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075442918","display_name":"Anina Gruica","orcid":"https://orcid.org/0009-0008-3066-3223"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Anina Gruica","raw_affiliation_strings":["\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5612 AZ, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5612 AZ, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025356502","display_name":"Alberto Ravagnani","orcid":"https://orcid.org/0000-0001-5901-9484"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alberto Ravagnani","raw_affiliation_strings":["\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5612 AZ, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\\dagger Department of Mathematics and Computer Science, Eindhoven University of Technology, 5612 AZ, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":2.1593,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.86860493,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"6","issue":"2","first_page":"79","last_page":"110"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998000264167786,"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/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/T11797","display_name":"graph theory and CDMA systems","score":0.996999979019165,"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/mathematics","display_name":"Mathematics","score":0.8367295265197754},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6265484690666199},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.6035122275352478},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5843899846076965},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5677582621574402},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5456817746162415},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5244255661964417},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.45656001567840576},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4479387402534485},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.4375610947608948},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.42676201462745667},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.39579012989997864},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.174513578414917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13959121704101562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08610543608665466}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8367295265197754},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6265484690666199},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.6035122275352478},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5843899846076965},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5677582621574402},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5456817746162415},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5244255661964417},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.45656001567840576},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4479387402534485},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.4375610947608948},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.42676201462745667},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.39579012989997864},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.174513578414917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13959121704101562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08610543608665466},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"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/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/21m1428947","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1428947","pdf_url":null,"source":{"id":"https://openalex.org/S2996807011","display_name":"SIAM Journal on Applied Algebra and Geometry","issn_l":"2470-6566","issn":["2470-6566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Applied Algebra and Geometry","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/deaa6ad0-2625-474b-b3c2-b6651a90a1aa","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/deaa6ad0-2625-474b-b3c2-b6651a90a1aa","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gruica, A & Ravagnani, A 2022, 'Common Complements of Linear Subspaces and the Sparseness of MRD Codes', SIAM Journal on Applied Algebra and Geometry, vol. 6, no. 2, pp. 79-110. https://doi.org/10.1137/21M1428947","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/deaa6ad0-2625-474b-b3c2-b6651a90a1aa","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/deaa6ad0-2625-474b-b3c2-b6651a90a1aa","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Applied Algebra and Geometry, 6(2), 79 - 110. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/deaa6ad0-2625-474b-b3c2-b6651a90a1aa","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/deaa6ad0-2625-474b-b3c2-b6651a90a1aa","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gruica, A & Ravagnani, A 2022, 'Common Complements of Linear Subspaces and the Sparseness of MRD Codes', SIAM Journal on Applied Algebra and Geometry, vol. 6, no. 2, pp. 79-110. https://doi.org/10.1137/21M1428947","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G660757063","display_name":"Structure and Asymptotic Density of Extremal Codes","funder_award_id":"OCENW.KLEIN.539","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1502102369","https://openalex.org/W1538550540","https://openalex.org/W1606480398","https://openalex.org/W1993359877","https://openalex.org/W2004166394","https://openalex.org/W2055060019","https://openalex.org/W2086297027","https://openalex.org/W2095547380","https://openalex.org/W2095811481","https://openalex.org/W2124113125","https://openalex.org/W2125838758","https://openalex.org/W2130632424","https://openalex.org/W2139416652","https://openalex.org/W2167266655","https://openalex.org/W2318600837","https://openalex.org/W2398693322","https://openalex.org/W2487105879","https://openalex.org/W2580044016","https://openalex.org/W2741412032","https://openalex.org/W2745281314","https://openalex.org/W2795054284","https://openalex.org/W2806875065","https://openalex.org/W2914659449","https://openalex.org/W2952958801","https://openalex.org/W2963761872","https://openalex.org/W2974757590","https://openalex.org/W2990083380","https://openalex.org/W3006225162","https://openalex.org/W3009813707","https://openalex.org/W3103202762","https://openalex.org/W3103759265","https://openalex.org/W3105122058","https://openalex.org/W3106534297"],"related_works":["https://openalex.org/W4289750385","https://openalex.org/W2883532523","https://openalex.org/W2348948427","https://openalex.org/W1909918105","https://openalex.org/W2068656449","https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W2612896625","https://openalex.org/W1789159349","https://openalex.org/W2113911300"],"abstract_inverted_index":{"Motivated":[0],"by":[1,207],"applications":[2],"to":[3,60,67,77,94,101,109,173],"the":[4,11,15,32,35,56,69,83,90,102,119,126,150,162,183,205,213],"theory":[5],"of":[6,13,17,20,23,31,34,72,92,121,164,170,182,212,216],"rank-metric":[7,217],"codes,":[8],"we":[9,112,131,189],"study":[10],"problem":[12],"estimating":[14],"number":[16,91,120,169,187],"common":[18,73],"complements":[19,74],"a":[21,26,176],"family":[22,36],"subspaces":[24],"over":[25],"finite":[27],"field":[28,57,103,151],"in":[29,125,136],"terms":[30],"cardinality":[33],"and":[37,44,79,115],"its":[38],"intersection":[39],"structure.":[40],"We":[41,62,159,203],"derive":[42],"upper":[43,114],"lower":[45,116],"bounds":[46,66,117],"for":[47,118,145,199],"this":[48],"number,":[49],"along":[50],"with":[51,75,99,154],"their":[52,168],"asymptotic":[53,178],"versions":[54],"as":[55,149,167],"size":[58,152],"tends":[59,172],"infinity.":[61],"then":[63,190],"use":[64],"these":[65],"describe":[68],"general":[70,209],"behavior":[71],"respect":[76,100],"sparseness":[78],"density,":[80],"showing":[81],"that":[82,140,192],"decisive":[84],"property":[85],"is":[86,97],"whether":[87],"or":[88],"not":[89],"spaces":[93],"be":[95],"complemented":[96],"negligible":[98],"size.":[104],"By":[105],"specializing":[106],"our":[107,193],"results":[108,198],"matrix":[110],"spaces,":[111],"obtain":[113],"maximum-rank-distance":[122],"(MRD)":[123],"codes":[124,142,166],"rank":[127],"metric.":[128],"In":[129],"particular,":[130],"answer":[132],"an":[133],"open":[134],"question":[135],"coding":[137],"theory,":[138,188],"proving":[139],"MRD":[141,165],"are":[143],"sparse":[144],"all":[146],"parameter":[147,201],"sets":[148],"grows,":[153],"only":[155],"very":[156],"few":[157],"exceptions.":[158],"also":[160],"investigate":[161],"density":[163,214],"columns":[171],"infinity,":[174],"obtaining":[175],"new":[177],"bound.":[179],"Using":[180],"properties":[181,211],"Euler":[184],"function":[185,215],"from":[186],"show":[191],"bound":[194],"improves":[195],"on":[196],"known":[197],"most":[200],"sets.":[202],"conclude":[204],"paper":[206],"establishing":[208],"structural":[210],"codes.":[218]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}