{"id":"https://openalex.org/W2585368599","doi":"https://doi.org/10.1109/tit.2017.2766292","title":"Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks","display_name":"Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks","publication_year":2017,"publication_date":"2017-10-25","ids":{"openalex":"https://openalex.org/W2585368599","doi":"https://doi.org/10.1109/tit.2017.2766292","mag":"2585368599"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2766292","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2766292","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://vbn.aau.dk/da/publications/65adb17b-2ee1-44ca-ae80-b206f2516dc2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Umberto Martinez-Penas","orcid":"https://orcid.org/0000-0003-2626-8139"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Umberto Martinez-Penas","raw_affiliation_strings":["Department of Mathematical Sciences, Aalborg University, Aalborg, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2626-8139","affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Aalborg University, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ryutaroh Matsumoto","orcid":"https://orcid.org/0000-0002-5085-8879"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryutaroh Matsumoto","raw_affiliation_strings":["Department of Information and Communication Engineering, Nagoya University, Nagoya, Japan"],"raw_orcid":"https://orcid.org/0000-0002-5085-8879","affiliations":[{"raw_affiliation_string":"Department of Information and Communication Engineering, Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7575,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.86449024,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"64","issue":"4","first_page":"2529","last_page":"2549"},"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.9617999792098999,"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.9617999792098999,"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.018699999898672104,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.002899999963119626,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5626000165939331},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.49309998750686646},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.49149999022483826},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.46050000190734863},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.43849998712539673},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43309998512268066},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.41600000858306885},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.374099999666214},{"id":"https://openalex.org/keywords/dual-code","display_name":"Dual code","score":0.36910000443458557},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.36910000443458557}],"concepts":[{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5626000165939331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5532000064849854},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.49309998750686646},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.49149999022483826},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.46050000190734863},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.43849998712539673},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43309998512268066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.429500013589859},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3928999900817871},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37630000710487366},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C73666251","wikidata":"https://www.wikidata.org/wiki/Q5310189","display_name":"Dual code","level":5,"score":0.36910000443458557},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.36910000443458557},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.34040001034736633},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3402000069618225},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32829999923706055},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.3052999973297119},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.2752000093460083},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.2712000012397766},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.2632000148296356},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.2596000134944916},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.2587999999523163},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.25099998712539673},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.2508000135421753}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.2017.2766292","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2766292","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:openaire/65adb17b-2ee1-44ca-ae80-b206f2516dc2","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/65adb17b-2ee1-44ca-ae80-b206f2516dc2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"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":"Martinez Pe\u00f1as, U & Matsumoto, R Y 2018, 'Relative generalized matrix weights of matrix codes for universal security on wire-tap networks', I E E E Transactions on Information Theory, vol. 64, no. 4, pp. 2529 - 2549. https://doi.org/10.1109/TIT.2017.2766292","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1612.01888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1612.01888","pdf_url":"https://arxiv.org/pdf/1612.01888","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/65adb17b-2ee1-44ca-ae80-b206f2516dc2","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/65adb17b-2ee1-44ca-ae80-b206f2516dc2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"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":"Martinez Pe\u00f1as, U & Matsumoto, R Y 2018, 'Relative generalized matrix weights of matrix codes for universal security on wire-tap networks', I E E E Transactions on Information Theory, vol. 64, no. 4, pp. 2529 - 2549. https://doi.org/10.1109/TIT.2017.2766292","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G502156158","display_name":null,"funder_award_id":"26289116","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7994486516","display_name":null,"funder_award_id":"DFF-5137-00076B","funder_id":"https://openalex.org/F4320322928","funder_display_name":"Danmarks Frie Forskningsfond"},{"id":"https://openalex.org/G854504215","display_name":null,"funder_award_id":"DFF-4002-00367","funder_id":"https://openalex.org/F4320322928","funder_display_name":"Danmarks Frie Forskningsfond"}],"funders":[{"id":"https://openalex.org/F4320322015","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W941231436","https://openalex.org/W1492657530","https://openalex.org/W1574756032","https://openalex.org/W1785358459","https://openalex.org/W1961596217","https://openalex.org/W1981676191","https://openalex.org/W1993359877","https://openalex.org/W2014449813","https://openalex.org/W2043769961","https://openalex.org/W2048235391","https://openalex.org/W2055060019","https://openalex.org/W2065853216","https://openalex.org/W2072942107","https://openalex.org/W2082506471","https://openalex.org/W2095547380","https://openalex.org/W2097117337","https://openalex.org/W2099920789","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2106570206","https://openalex.org/W2111992817","https://openalex.org/W2120258386","https://openalex.org/W2127558904","https://openalex.org/W2128555802","https://openalex.org/W2138928022","https://openalex.org/W2140204181","https://openalex.org/W2141420453","https://openalex.org/W2151072735","https://openalex.org/W2152303628","https://openalex.org/W2165029016","https://openalex.org/W2172754641","https://openalex.org/W2240863905","https://openalex.org/W2323514020","https://openalex.org/W2329504308","https://openalex.org/W2330662384","https://openalex.org/W2465034053","https://openalex.org/W2964100779","https://openalex.org/W6600739974","https://openalex.org/W6632028453","https://openalex.org/W6680199495","https://openalex.org/W6680315945","https://openalex.org/W6698135423","https://openalex.org/W6728374566"],"related_works":[],"abstract_inverted_index":{"Universal":[0],"security":[1,100,200],"over":[2,26,60,86],"a":[3,27,61,187],"network":[4,7,133],"with":[5,116,182],"linear":[6,15,25,85,154,203],"coding":[8],"has":[9],"been":[10],"intensively":[11],"studied.":[12],"However,":[13],"previous":[14],"codes":[16,55,155],"and":[17,56,75,93,109,131,194,216,221,226],"code":[18,81,104,108,180],"pairs":[19,82,181],"used":[20,32,89],"for":[21,80,159,166],"this":[22,65],"purpose":[23],"were":[24],"larger":[28],"field":[29,88],"than":[30],"that":[31,83,95,208],"on":[33,156,186],"the":[34,38,87,91,98,117,125,142,174],"network,":[35,92],"which":[36,135],"restricts":[37],"possible":[39,161],"packet":[40,162,167],"lengths":[41,168],"of":[42,102,199,202],"optimal":[43,151],"universal":[44,99,152,176],"secure":[45,132,153,177],"codes,":[46],"does":[47],"not":[48,169],"allow":[49],"to":[50],"apply":[51],"known":[52],"list-decodable":[53,178],"rank-metric":[54,179],"requires":[57],"performing":[58],"operations":[59],"large":[62],"field.":[63],"In":[64],"paper,":[66],"we":[67,123,206],"introduce":[68],"new":[69,144,197],"parameters":[70,145,210],"(relative":[71],"generalized":[72,112,120,213,223],"matrix":[73,113],"weights":[74,114,130,215,225],"relative":[76,212,217,222,227],"dimension/rank":[77],"support":[78],"profile)":[79],"are":[84],"in":[90,164],"show":[94,207],"they":[96],"measure":[97],"performance":[101],"these":[103,128],"pairs.":[105],"For":[106],"one":[107],"non-square":[110],"matrices,":[111],"coincide":[115],"existing":[118],"Delsarte":[119],"weights,":[121],"hence":[122],"prove":[124],"connection":[126],"between":[127],"latter":[129],"coding,":[134],"was":[136],"left":[137],"open.":[138],"As":[139],"main":[140],"applications,":[141],"proposed":[143],"enable":[146],"us":[147],"to:":[148],"1)":[149],"obtain":[150,173,196],"noiseless":[157],"networks":[158],"all":[160],"lengths,":[163],"particular":[165],"considered":[170],"before,":[171],"2)":[172],"first":[175],"polynomial-sized":[183],"lists,":[184],"based":[185],"recent":[188],"construction":[189],"by":[190],"Guruswami":[191],"et":[192],"al;":[193],"3)":[195],"characterizations":[198],"equivalences":[201],"codes.":[204],"Finally,":[205],"our":[209],"extend":[211],"Hamming":[214],"dimension/length":[218],"profile,":[219,229],"respectively,":[220],"rank":[224],"dimension/intersection":[228],"respectively.":[230]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2017-02-10T00:00:00"}