Bounds for Cooperative Locality Using Generalized Hamming Weights

Khaled A.S. Abdel-Ghaffar, Jos H. Weber

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

4 Citations (Scopus)
27 Downloads (Pure)

Abstract

The Cadambe-Mazumdar bound gives a necessary condition for a code to have a certain locality in case of a single erasure in terms of length, dimension, and Hamming distance of the code and of certain shortened codes. The bound has been generalized by Rawat, Mazumdar, and Vishwanath to recover multiple erasures in a cooperative repair scenario. In this paper, the generalized Hamming weights of the code and its shortened codes, which include the Hamming distance as one component, are incorporated to obtain bounds on locality to recover a single
erasure or multiple erasures cooperatively. The new bounds give sharper necessary conditions than existing bounds.
Original languageEnglish
Title of host publicationProceedings of the 2017 IEEE International Symposium on Information Theory
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages699-703
Number of pages5
ISBN (Electronic)978-1-5090-4096-4
DOIs
Publication statusPublished - Jun 2017
Event2017 IEEE International Symposium on Information Theory - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017
https://isit2017.org/

Conference

Conference2017 IEEE International Symposium on Information Theory
Abbreviated titleISIT 2017
CountryGermany
CityAachen
Period25/06/1730/06/17
Internet address

Keywords

  • Maintenance engineering
  • Linear codes
  • Hamming distance
  • Hamming weight
  • Generators
  • Electronic mail

Fingerprint

Dive into the research topics of 'Bounds for Cooperative Locality Using Generalized Hamming Weights'. Together they form a unique fingerprint.

Cite this