Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > POLYNMIAL METHOD:
Reports tagged with Polynmial method:
TR21-145 | 19th October 2021
Omar Alrabiah, Venkatesan Guruswami

Revisiting a Lower Bound on the Redundancy of Linear Batch Codes

A recent work of Li and Wootters (2021) shows a redundancy lower bound of \Omega(\sqrt{Nk}) for systematic linear k-batch codes of block length N by looking at the O(k) tensor power of the dual code. In this note, we present an alternate proof of their result via a linear independence ... more >>>




ISSN 1433-8092 | Imprint