Batch codes based on lifted multiplicity codes

Rina Polyanskaya, Nikita Polyanskii

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)

    Abstract

    A binary k-batch code maps a binary string x of length n into a binary string y of length N, such that for every collection of k symbols from x, there exist k mutually disjoint recovering sets from y. We develop a new explicit coding construction of binary batch codes based on bivariate lifted multiplicity codes. For ϵ (0, 27, 0.47) and k = nϵ, our proposed k-batch codes improve the redundancy of previously known ones.

    Original languageEnglish
    Title of host publication2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages69-74
    Number of pages6
    ISBN (Electronic)9781728119441
    DOIs
    Publication statusPublished - Oct 2019
    Event16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019 - Moscow, Russian Federation
    Duration: 21 Oct 201925 Oct 2019

    Publication series

    Name2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019

    Conference

    Conference16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
    Country/TerritoryRussian Federation
    CityMoscow
    Period21/10/1925/10/19

    Keywords

    • batch codes
    • Disjoint recovering sets
    • lifted codes
    • multiplicity codes

    Fingerprint

    Dive into the research topics of 'Batch codes based on lifted multiplicity codes'. Together they form a unique fingerprint.

    Cite this