Constructions of Batch Codes via Finite Geometry

Nikita Polyanskii, Ilya Vorobyev

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

    9 Citations (Scopus)

    Abstract

    A primitive k-batch code encodes a string x of length n into string y of length N, such that each multiset of k symbols from x has k mutually disjoint recovering sets from y. We develop new explicit and random coding constructions of linear primitive batch codes based on finite geometry. In some parameter regimes, our proposed codes have lower redundancy than previously known batch codes.

    Original languageEnglish
    Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages360-364
    Number of pages5
    ISBN (Electronic)9781538692912
    DOIs
    Publication statusPublished - Jul 2019
    Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
    Duration: 7 Jul 201912 Jul 2019

    Publication series

    NameIEEE International Symposium on Information Theory - Proceedings
    Volume2019-July
    ISSN (Print)2157-8095

    Conference

    Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
    Country/TerritoryFrance
    CityParis
    Period7/07/1912/07/19

    Keywords

    • finite geometry
    • primitive batch codes
    • Private information retrieval

    Fingerprint

    Dive into the research topics of 'Constructions of Batch Codes via Finite Geometry'. Together they form a unique fingerprint.

    Cite this