Abstract
Erasure combinatorial batch codes are a family of codes for distributed storage systems which not only allow for the retrieval of any set of a limited number of items even in presence of server failures, but also balance the load among the servers when retrieving. To present new constructions is one of the objectives of studying erasure combinatorial batch codes. Nonadaptive group testing has many applications to various fields such as DNA library screening and multi-access communications, etc. A lot of constructions of nonadaptive group testing have been given by many authors. In this paper, based on nonadaptive group testing, we obtain three classes of erasure combinatorial batch codes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
