Binary Batch Codes With Improved Redundancy

DOI10.1109/TIT.2020.3013603MaRDI QIDQ5138898zbMATH OpenOpenAlexFDO

Authors Rina Polyanskaya, Ilya Vorobyev, Nikita Polyanskii

Publication date 4 December 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2020.3013603

zbMATH Keywords

constructions of binary primitive batch codesfinite geometries

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(2)

• Batch codes from affine Cartesian codes and quotient spaces
• Batch codes and their applications

This page was built for publication: Binary Batch Codes With Improved Redundancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138898)