{"id":"https://openalex.org/W941231436","doi":"https://doi.org/10.1109/tit.2016.2570238","title":"On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding","display_name":"On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding","publication_year":2016,"publication_date":"2016-05-18","ids":{"openalex":"https://openalex.org/W941231436","doi":"https://doi.org/10.1109/tit.2016.2570238","mag":"941231436"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2016.2570238","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2016.2570238","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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, Aalborg, Denmark","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"]},{"raw_affiliation_string":"Department of Mathematical Sciences, Aalborg University, Aalborg, 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":null,"apc_paid":null,"fwci":7.087,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.971336,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"62","issue":"7","first_page":"4081","last_page":"4095"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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":1.0,"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.9944000244140625,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9929999709129333,"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/hamming-distance","display_name":"Hamming distance","score":0.7855271697044373},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.7239226698875427},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.7177819609642029},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.6806657314300537},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6780555248260498},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6462678909301758},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.6392389535903931},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6183443665504456},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6059021949768066},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.5394713282585144},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5390903353691101},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5349726676940918},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5230111479759216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4490903615951538},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.43846818804740906},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4101724326610565},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40343719720840454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3851228356361389},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37525027990341187},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3053349256515503},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2694348692893982},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.15972691774368286},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11160454154014587}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7855271697044373},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.7239226698875427},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.7177819609642029},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.6806657314300537},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6780555248260498},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6462678909301758},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.6392389535903931},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6183443665504456},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6059021949768066},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.5394713282585144},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5390903353691101},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5349726676940918},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5230111479759216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4490903615951538},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.43846818804740906},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4101724326610565},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40343719720840454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3851228356361389},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37525027990341187},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3053349256515503},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2694348692893982},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.15972691774368286},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11160454154014587},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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":2,"locations":[{"id":"doi:10.1109/tit.2016.2570238","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2016.2570238","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/03ac7e31-7453-47fd-b54f-60b24b46a27a","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/03ac7e31-7453-47fd-b54f-60b24b46a27a","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 2016, 'On the similarities between generalized rank and Hamming weights and their applications to network coding', I E E E Transactions on Information Theory, vol. 62, no. 7, pp. 4081-4095. https://doi.org/10.1109/TIT.2016.2570238","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1492657530","https://openalex.org/W1534864618","https://openalex.org/W1557415002","https://openalex.org/W1559343931","https://openalex.org/W1574756032","https://openalex.org/W1785358459","https://openalex.org/W1981676191","https://openalex.org/W1981821301","https://openalex.org/W2004865039","https://openalex.org/W2006017061","https://openalex.org/W2019215605","https://openalex.org/W2020484625","https://openalex.org/W2024954696","https://openalex.org/W2048235391","https://openalex.org/W2079443739","https://openalex.org/W2097117337","https://openalex.org/W2099920789","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2111992817","https://openalex.org/W2120258386","https://openalex.org/W2127558904","https://openalex.org/W2128555802","https://openalex.org/W2132157287","https://openalex.org/W2133693898","https://openalex.org/W2136563111","https://openalex.org/W2138928022","https://openalex.org/W2139416652","https://openalex.org/W2140204181","https://openalex.org/W2141420453","https://openalex.org/W2149286354","https://openalex.org/W2152303628","https://openalex.org/W2162013214","https://openalex.org/W2165029016","https://openalex.org/W2534491645","https://openalex.org/W3088602358","https://openalex.org/W3102272702","https://openalex.org/W4206775542","https://openalex.org/W6632028453","https://openalex.org/W6636930879","https://openalex.org/W6679500054","https://openalex.org/W6728374566","https://openalex.org/W6785648876"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W4300879987","https://openalex.org/W2786543974","https://openalex.org/W2106912783","https://openalex.org/W941231436","https://openalex.org/W4300378649","https://openalex.org/W2951186276","https://openalex.org/W2625226171","https://openalex.org/W3001656036"],"abstract_inverted_index":{"Rank":[0],"weights":[1,5,28,32,114],"and":[2,12,15,29,36,39,48,62,115,122,132],"generalized":[3,30,116],"rank":[4,89,149],"have":[6,59,83,96,152],"been":[7,60,85,97],"proved":[8,63,98],"to":[9,87,110],"characterize":[10],"error":[11,35],"erasure":[13,37],"correction,":[14,38],"information":[16,40],"leakage":[17,41],"in":[18,22,42,64,71,93,124,139,147,155],"linear":[19],"network":[20,140],"coding,":[21],"the":[23,57,65,72,88,120,130,134,144,148,156],"same":[24],"way":[25],"as":[26,76],"Hamming":[27,31,73,157],"describe":[33],"classical":[34],"wire-tap":[43],"channels":[44],"of":[45,80,106,136,143],"type":[46],"II":[47],"code-based":[49],"secret":[50],"sharing.":[51],"Although":[52],"many":[53,67],"similarities":[54,138],"between":[55],"both":[56,113,125],"cases":[58,95,126],"established":[61],"literature,":[66],"other":[68],"known":[69],"results":[70,121,146],"case,":[74],"such":[75],"bounds":[77],"or":[78,92],"characterizations":[79],"weight-preserving":[81],"maps,":[82],"not":[84],"translated":[86],"case":[90,150],"yet,":[91],"some":[94],"after":[99],"developing":[100],"a":[101],"different":[102],"machinery.":[103],"The":[104],"aim":[105],"this":[107],"paper":[108],"is":[109],"further":[111],"relate":[112],"weights,":[117],"show":[118],"that":[119],"proofs":[123],"are":[127],"usually":[128],"essentially":[129],"same,":[131],"see":[133],"significance":[135],"these":[137],"coding.":[141],"Some":[142],"new":[145,153],"also":[151],"consequences":[154],"case.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}