{"id":"https://openalex.org/W3200793038","doi":"https://doi.org/10.1109/tit.2024.3354513","title":"Maximum Sum-Rank Distance Codes Over Finite Chain Rings","display_name":"Maximum Sum-Rank Distance Codes Over Finite Chain Rings","publication_year":2024,"publication_date":"2024-01-19","ids":{"openalex":"https://openalex.org/W3200793038","doi":"https://doi.org/10.1109/tit.2024.3354513","mag":"3200793038"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2024.3354513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2024.3354513","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/dbd59519-2951-4fc1-b690-b1fe549dbcf9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006688702","display_name":"Umberto Mart\u00ednez-Pe\u00f1as","orcid":"https://orcid.org/0000-0003-2626-8139"},"institutions":[{"id":"https://openalex.org/I57825437","display_name":"University of Neuch\u00e2tel","ror":"https://ror.org/00vasag41","country_code":"CH","type":"education","lineage":["https://openalex.org/I57825437"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Umberto Mart\u00ednez-Pe\u00f1as","raw_affiliation_strings":["Institutes of Computer Science and Mathematics, University of Neuchâtel, Neuchâtel, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-2626-8139","affiliations":[{"raw_affiliation_string":"Institutes of Computer Science and Mathematics, University of Neuchâtel, Neuchâtel, Switzerland","institution_ids":["https://openalex.org/I57825437"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009036826","display_name":"Sven Puchinger","orcid":"https://orcid.org/0000-0002-7474-2678"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]},{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DE","DK"],"is_corresponding":false,"raw_author_name":"Sven Puchinger","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Technical University of Denmark (DTU), Lyngby, Denmark","Department of Electrical and Computer Engineering, Technical University of Munich, Munich, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7474-2678","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Technical University of Denmark (DTU), Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Technical University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6109,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70391607,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"70","issue":"6","first_page":"3878","last_page":"3890"},"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.9994000196456909,"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.9988999962806702,"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/chain","display_name":"Chain (unit)","score":0.5528442859649658},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5076292753219604},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5075670480728149},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47902029752731323},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.411734402179718},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39130735397338867},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1562754511833191}],"concepts":[{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.5528442859649658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5076292753219604},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5075670480728149},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47902029752731323},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.411734402179718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39130735397338867},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1562754511833191},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2024.3354513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2024.3354513","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/dbd59519-2951-4fc1-b690-b1fe549dbcf9","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/dbd59519-2951-4fc1-b690-b1fe549dbcf9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"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":"Martinez-Penas , U & Puchinger , S 2024 , ' Maximum Sum-Rank Distance Codes over Finite Chain Rings ' , IEEE Transactions on Information Theory , vol. 70 , no. 6 , pp. 3878-3890 . https://doi.org/10.1109/TIT.2024.3354513","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/dbd59519-2951-4fc1-b690-b1fe549dbcf9","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/dbd59519-2951-4fc1-b690-b1fe549dbcf9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"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":"Martinez-Penas , U & Puchinger , S 2024 , ' Maximum Sum-Rank Distance Codes over Finite Chain Rings ' , IEEE Transactions on Information Theory , vol. 70 , no. 6 , pp. 3878-3890 . https://doi.org/10.1109/TIT.2024.3354513","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1497711190","https://openalex.org/W1502102369","https://openalex.org/W1581678291","https://openalex.org/W1590335557","https://openalex.org/W1966237841","https://openalex.org/W1999121964","https://openalex.org/W2015300545","https://openalex.org/W2055060019","https://openalex.org/W2095980332","https://openalex.org/W2101517582","https://openalex.org/W2106403318","https://openalex.org/W2110221038","https://openalex.org/W2118040894","https://openalex.org/W2126824576","https://openalex.org/W2136571043","https://openalex.org/W2139416652","https://openalex.org/W2148575324","https://openalex.org/W2331005958","https://openalex.org/W2541979517","https://openalex.org/W2569741146","https://openalex.org/W2801400867","https://openalex.org/W2956089011","https://openalex.org/W2963005667","https://openalex.org/W2963073980","https://openalex.org/W2964235003","https://openalex.org/W2964936392","https://openalex.org/W3063923897","https://openalex.org/W3081293222","https://openalex.org/W3104978253","https://openalex.org/W3125267404","https://openalex.org/W3135612806","https://openalex.org/W3135980946","https://openalex.org/W3155530075","https://openalex.org/W3164436005","https://openalex.org/W3165931569","https://openalex.org/W3197539179","https://openalex.org/W3200793038","https://openalex.org/W3216335061","https://openalex.org/W4291999168","https://openalex.org/W4308152276"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"maximum":[3],"sum-rank":[4,74,80],"distance":[5],"(MSRD)":[6],"codes":[7,11,24,105],"and":[8,59,66,77,118],"linearized":[9,22,103],"Reed-Solomon":[10,23],"are":[12,25,49,86,123],"extended":[13,50],"to":[14,51],"finite":[15,28,36,52,90,107],"chain":[16,29,53,91],"rings.":[17,54,92],"It":[18],"is":[19],"proven":[20],"that":[21],"MSRD":[26],"over":[27,89,106],"rings,":[30],"extending":[31],"the":[32,39,44,57,97],"known":[33,99],"result":[34],"for":[35,102],"fields.":[37,108],"For":[38],"proof,":[40],"several":[41],"results":[42],"on":[43],"roots":[45],"of":[46,61],"skew":[47,64,69],"polynomials":[48,65],"These":[55],"include":[56],"existence":[58],"uniqueness":[60],"minimum-degree":[62],"annihilator":[63],"Lagrange":[67],"interpolator":[68],"polynomials.":[70],"A":[71],"general":[72],"cubic-complexity":[73],"Welch-Berlekamp":[75],"decoder":[76,82,101],"a":[78],"quadratic-complexity":[79],"syndrome":[81,100],"(under":[83],"some":[84],"assumptions)":[85],"then":[87],"provided":[88],"The":[93],"latter":[94],"also":[95],"constitutes":[96],"first":[98],"Reed\u2013Solomon":[104],"Finally,":[109],"applications":[110],"in":[111],"Space-Time":[112],"Coding":[113,122],"with":[114],"multiple":[115],"fading":[116],"blocks":[117],"physical-layer":[119],"multishot":[120],"Network":[121],"discussed.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}