{"id":"https://openalex.org/W2743336384","doi":"https://doi.org/10.1109/isit.2017.8006618","title":"Bounds for cooperative locality using generalized hamming weights","display_name":"Bounds for cooperative locality using generalized hamming weights","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2743336384","doi":"https://doi.org/10.1109/isit.2017.8006618","mag":"2743336384"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006618","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006618","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"},"type":"conference-paper","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/A5085375728","display_name":"Aludaat Khaled","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. S. Khaled","raw_affiliation_strings":["University of California Davis, Davis, CA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Davis, Davis, CA, US","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097622745","display_name":"Abdel-Ghaffar","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Abdel-Ghaffar","raw_affiliation_strings":["Delft University of Technology, Delft, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058084781","display_name":"Jos H. Weber","orcid":"https://orcid.org/0000-0002-8333-1301"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jos H. Weber","raw_affiliation_strings":["Technische Universiteit Delft, Delft, Zuid-Holland, NL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universiteit Delft, Delft, Zuid-Holland, NL","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5537,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69649993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"699","last_page":"703"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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.9997000098228455,"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.9990000128746033,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9957000017166138,"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/hamming-code","display_name":"Hamming code","score":0.8188420534133911},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7699171900749207},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.7402372360229492},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.7145136594772339},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.6755945086479187},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6365064382553101},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.608341634273529},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.5276942253112793},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5246500968933105},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4935256242752075},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.48540934920310974},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.48415881395339966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46410974860191345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42852064967155457},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3908097743988037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34726232290267944},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2904765009880066},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.244592547416687},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.0956006646156311}],"concepts":[{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.8188420534133911},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7699171900749207},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.7402372360229492},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.7145136594772339},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.6755945086479187},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6365064382553101},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.608341634273529},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.5276942253112793},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5246500968933105},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4935256242752075},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.48540934920310974},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.48415881395339966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46410974860191345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42852064967155457},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3908097743988037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34726232290267944},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2904765009880066},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.244592547416687},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0956006646156311},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/isit.2017.8006618","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006618","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:tudelft.nl:uuid:36a09c51-586a-487f-a175-1113d072745c","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:36a09c51-586a-487f-a175-1113d072745c","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1531572787","https://openalex.org/W1556443961","https://openalex.org/W1957362188","https://openalex.org/W1993830711","https://openalex.org/W2050500290","https://openalex.org/W2127558904","https://openalex.org/W2761980362","https://openalex.org/W2962775071","https://openalex.org/W2963063105","https://openalex.org/W3105115254"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2105471374","https://openalex.org/W4300879987","https://openalex.org/W2786543974","https://openalex.org/W2964136540","https://openalex.org/W2364868136","https://openalex.org/W2982774419","https://openalex.org/W2740543340","https://openalex.org/W2106912783","https://openalex.org/W1523946569"],"abstract_inverted_index":{"The":[0,37,94],"Cadambe-Mazumdar":[1],"bound":[2,38],"gives":[3],"a":[4,8,12,18,52,87],"necessary":[5,99],"condition":[6],"for":[7],"code":[9,31,65],"to":[10,47,80,85],"have":[11],"certain":[13,34],"locality":[14,84],"in":[15,21,51],"case":[16],"of":[17,23,29,33,63],"single":[19,88],"erasure":[20,89],"terms":[22],"length,":[24],"dimension,":[25],"and":[26,32,45,66],"Hamming":[27,61,73],"distance":[28,74],"the":[30,59,64,72],"shortened":[35,68],"codes.":[36],"has":[39],"been":[40],"generalized":[41,60],"by":[42],"Rawat,":[43],"Mazumdar,":[44],"Vishwanath":[46],"recover":[48,86],"multiple":[49,91],"erasures":[50,92],"cooperative":[53],"repair":[54],"scenario.":[55],"In":[56],"this":[57],"paper,":[58],"weights":[62],"its":[67],"codes,":[69],"which":[70],"include":[71],"as":[75],"one":[76],"component,":[77],"are":[78],"incorporated":[79],"obtain":[81],"bounds":[82,96],"on":[83],"or":[90],"cooperatively.":[93],"new":[95],"give":[97],"sharper":[98],"conditions":[100],"than":[101],"existing":[102],"bounds.":[103]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2017-08-17T00:00:00"}