Bibliographic Details
| Title: |
Codes With Availability for Multiple Code Symbols. |
| Authors: |
Kadiyam, Ujwal Deep, Das, Smarajit |
| Source: |
IEEE Communications Letters; Aug2021, Vol. 25 Issue 8, p2477-2481, 5p |
| Abstract: |
Codes with availability allow us to access any code symbol simultaneously t times using t disjoint recovery sets in distributed data storage. Codes with availability that are studied in the literature provide availability for individual code symbols in the codeword. In this letter, we consider a new class of codes with availability. These codes provide availability t for subsets of code symbols called multi-symbol sets. For these codes, an upper-bound on the minimum Hamming distance is derived. A construction for optimal codes with information multi-symbol availability is given. The optimal codes with multi-symbol availability allow us to access more symbols locally with the same locality, when compared to optimal codes with individual code symbol availability. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Communications Letters is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science