{"id":"https://openalex.org/W2617914654","doi":"https://doi.org/10.1007/s12095-018-0279-4","title":"Universal secure rank-metric coding schemes with optimal communication overheads","display_name":"Universal secure rank-metric coding schemes with optimal communication overheads","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2617914654","doi":"https://doi.org/10.1007/s12095-018-0279-4","mag":"2617914654"},"language":"en","primary_location":{"id":"doi:10.1007/s12095-018-0279-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12095-018-0279-4","pdf_url":null,"source":{"id":"https://openalex.org/S129219326","display_name":"Cryptography and Communications","issn_l":"1936-2447","issn":["1936-2447","1936-2455"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography and Communications","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1705.10592","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/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Umberto Martinez-Penas","raw_affiliation_strings":["Department of Mathematical Sciences, Aalborg University, Denmark","Department of Mathematical Sciences\u2028Aalborg University\u2028Aalborg, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Aalborg University, Denmark","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematical Sciences\u2028Aalborg University\u2028Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006688702"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.2197,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56703562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"2","first_page":"147","last_page":"166"},"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.9994000196456909,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9986000061035156,"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/computer-science","display_name":"Computer science","score":0.5848612785339355},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.562227189540863},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5464906692504883},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5310680866241455},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.464147686958313},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.459042489528656},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4024370610713959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38955652713775635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3335801959037781},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.28551608324050903}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5848612785339355},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.562227189540863},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5464906692504883},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5310680866241455},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.464147686958313},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.459042489528656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4024370610713959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38955652713775635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3335801959037781},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28551608324050903},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s12095-018-0279-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12095-018-0279-4","pdf_url":null,"source":{"id":"https://openalex.org/S129219326","display_name":"Cryptography and Communications","issn_l":"1936-2447","issn":["1936-2447","1936-2455"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography and Communications","raw_type":"journal-article"},{"id":"doi:10.1109/isit.2017.8007032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007032","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"},{"id":"pmh:oai:arXiv.org:1705.10592","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1705.10592","pdf_url":"https://arxiv.org/pdf/1705.10592","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"},{"id":"pmh:oai:pure.atira.dk:publications/e833cbf1-2c23-43d7-9ebc-1a4c5709dec5","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/e833cbf1-2c23-43d7-9ebc-1a4c5709dec5","pdf_url":"https://arxiv.org/pdf/1705.10592.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Martinez Pe\u00f1as , U 2017 , Universal secure rank-metric coding schemes with optimal communication overheads . in Proceedings of the 2017 IEEEE International Symposium on Information Theory (ISIT2017) . IEEE , I E E E International Symposium on Information Theory. Proceedings , pp. 2761-2766 , 2017 IEEE International Symposium on Information Theory , Achen , Germany , 25/06/2017 . https://doi.org/10.1109/ISIT.2017.8007032","raw_type":"contributionToPeriodical"},{"id":"mag:2617914654","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1705.10592.pdf","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.atira.dk:publications/068e035b-81e7-41cb-ba46-bcdcb9798236","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/068e035b-81e7-41cb-ba46-bcdcb9798236","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Martinez Pe\u00f1as , U 2019 , ' Universal secure rank-metric coding schemes with optimal communication overheads ' , Cryptography and Communications , vol. 11 , no. 2 , pp. 147-166 . https://doi.org/10.1007/s12095-018-0279-4","raw_type":"article"},{"id":"doi:10.48550/arxiv.1705.10592","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1705.10592","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1705.10592","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1705.10592","pdf_url":"https://arxiv.org/pdf/1705.10592","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3143276367","display_name":null,"funder_award_id":"DFF-4002-00367","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"},{"id":"https://openalex.org/G5940550827","display_name":null,"funder_award_id":"DFF-5137-00076B","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"},{"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/F4320310485","display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d","ror":"https://ror.org/03ge1nb22"},{"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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W941231436","https://openalex.org/W1641218312","https://openalex.org/W1785358459","https://openalex.org/W1993359877","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2048235391","https://openalex.org/W2058863419","https://openalex.org/W2095547380","https://openalex.org/W2099837838","https://openalex.org/W2105185344","https://openalex.org/W2105403121","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2138928022","https://openalex.org/W2150777202","https://openalex.org/W2152303628","https://openalex.org/W2167046508","https://openalex.org/W2962938759","https://openalex.org/W2963072024","https://openalex.org/W2963969531","https://openalex.org/W2964327303","https://openalex.org/W3106482607"],"related_works":["https://openalex.org/W2952417846","https://openalex.org/W1886578798","https://openalex.org/W2059920176","https://openalex.org/W2406425920","https://openalex.org/W2929437377","https://openalex.org/W1565936079","https://openalex.org/W2232446554","https://openalex.org/W3125093132","https://openalex.org/W2963307211","https://openalex.org/W2416829003","https://openalex.org/W2988182426","https://openalex.org/W2739686543","https://openalex.org/W1823223148","https://openalex.org/W1547086409","https://openalex.org/W1519973751","https://openalex.org/W2784239188","https://openalex.org/W2903883542","https://openalex.org/W3187534145","https://openalex.org/W3032245916","https://openalex.org/W2781270075"],"abstract_inverted_index":{"We":[0,32],"study":[1],"the":[2,6,114,144,149],"problem":[3],"of":[4,79,116,120,132,143],"reducing":[5],"communication":[7,71,104],"overhead":[8],"from":[9],"a":[10,21,53],"wire-tap":[11],"channel":[12],"or":[13],"storage":[14,45],"system":[15],"where":[16],"data":[17],"is":[18,52,146],"encoded":[19],"as":[20],"matrix,":[22],"when":[23,106,137],"more":[24],"columns":[25,117],"(or":[26],"their":[27,93],"linear":[28,39,61],"combinations)":[29],"are":[30],"available.":[31],"present":[33],"its":[34],"applications":[35],"to":[36,55,67,77,92,129],"universal":[37],"secure":[38,43],"network":[40],"coding":[41,57,84],"and":[42,95,100,112,118],"distributed":[44],"with":[46,64,69,86,90,101],"crisscross":[47],"erasures.":[48],"Our":[49],"main":[50],"contribution":[51],"method":[54,76,125,145],"transform":[56],"schemes":[58,68,85],"based":[59],"on":[60],"rank-metric":[62],"codes,":[63,81],"certain":[65],"properties,":[66],"lower":[70],"overheads.":[72],"By":[73],"applying":[74],"this":[75],"pairs":[78],"Gabidulin":[80],"we":[82],"obtain":[83],"optimal":[87,103],"information":[88],"rate":[89],"respect":[91],"security":[94],"rank":[96,134],"error":[97],"correction":[98],"capability,":[99],"universally":[102],"overheads,":[105],"n":[107,111,138],"\u2264":[108],"m,":[109],"being":[110],"m":[113],"number":[115,119],"rows,":[121],"respectively.":[122],"Moreover,":[123],"our":[124],"can":[126],"be":[127],"applied":[128],"other":[130],"families":[131],"maximum":[133],"distance":[135],"codes":[136],">":[139],"m.":[140],"The":[141],"downside":[142],"generally":[147],"expanding":[148],"packet":[150],"length,":[151],"but":[152],"some":[153],"practical":[154],"instances":[155],"come":[156],"at":[157],"no":[158],"cost.":[159]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2022-10-03T00:00:00"}