Optimal combinatorial batch codes derived from dual systems
نویسندگان
چکیده
منابع مشابه
Combinatorial batch codes
In this paper, we study batch codes, which were introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [4]. A batch code specifies a method to distribute a database of n items among m devices (servers) in such a way that any k items can be retrieved by reading at most t items from each of the servers. It is of interest to devise batch codes that minimize the total storage, denoted by N , over...
متن کاملOptimal combinatorial batch codes based on block designs
Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai, represent the distributed storage of an n-element data set on m servers in such a way that any batch of k data items can be retrieved by reading at most one (or more generally, t) items from each server, while keeping the total storage over m servers equal to N . This paper considers a class of batch codes (for t = 1), called c...
متن کاملCombinatorial batch codes: A lower bound and optimal constructions
Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [1], are methods for solving the following data storage problem: n data items are to be stored in m servers in such a way that any k of the n items can be retrieved by reading at most t items from each server, and that the total number of items stored in m servers is N . A Combinatorial batch code (CBC) is a batch code where ...
متن کاملMore on Combinatorial Batch Codes
Paterson, Stinson and Wei [2] introduced Combinatorial batch codes, which are combinatorial description of Batch code. Batch codes were first presented by Ishai, Kushilevita, Ostrovsky and Sahai [1] in STOC’04. In this paper we answer some of the questions put forward by Paterson, Stinson and Wei and give some results for the general case t > 1 which were not studied by the authors.
متن کاملError-Correcting Codes Derived from Combinatorial Games
The losing positions of certain combinatorial games constitute linear error-detecting and -correcting codes. We show that a large class of games, which can be cast in the form of annihilation games, provides a potentially polynomial method for computing codes (anncodes). We also give a short proof of the basic properties of the previously known lexicodes, which were defined by means of an expon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Miskolc Mathematical Notes
سال: 2011
ISSN: 1787-2405,1787-2413
DOI: 10.18514/mmn.2011.325