OpenAlex ·
A weak Hellinger inequality for noisy Boolean channels
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.28534
- Original
- Read it at the publisher
- Topics
Abstract
A weak form of the Hellinger conjecture of Anantharam, Bogdanov, Chakrabarti, Jayram, and Nair for the binary symmetric channel is proved: dictator functions maximize Hellinger $Φ$-entropy among all Boolean functions of the input and all one-bit statistics of the output of a noisy channel. The technical heart of the matter is an explicit inequality in three real parameters, which is proved using explicit polynomial approximations and computer-assisted positivity checks. The results are also formally verified in Lean 4.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
A linear-in-$q$ range of dimensions for the MDS conjecture over $\mathbb F_q$ in odd characteristic
Minimal representations of topology-preserving quantum-like states
Exact Second-Order Zarankiewicz Numbers for Complete-Graph Incidence Families
Sampling Line-Graph Colorings with Constant Extra Colors
Irrational Seshadri constants from dihedral orbits
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.