Nikhil Shagrithaya
@nikhilshagri.bsky.social
PhD student at University of Michigan.
nikhilshagri.github.io
nikhilshagri.github.io
Reposted by Nikhil Shagrithaya
With my great students Yeyuan Chen and Nikhil @nikhilshagri.bsky.social, we explicitly construct linear bit-fixing extractors that extract all entropy with only a *constant* seed length (optimal up to a constant factor). This has many interesting consequences such as: (1/2)
arxiv.org/abs/2504.03090
arxiv.org/abs/2504.03090
Optimal Erasure Codes and Codes on Graphs
We construct constant-sized ensembles of linear error-correcting codes over any fixed alphabet that can correct a given fraction of adversarial erasures at rates approaching the Singleton bound arbitr...
arxiv.org
April 11, 2025 at 6:50 PM
With my great students Yeyuan Chen and Nikhil @nikhilshagri.bsky.social, we explicitly construct linear bit-fixing extractors that extract all entropy with only a *constant* seed length (optimal up to a constant factor). This has many interesting consequences such as: (1/2)
arxiv.org/abs/2504.03090
arxiv.org/abs/2504.03090