Optimal coefficient for approximate full-parity hiding
Determine the optimal coefficient relating the decoding score of a three-bit random-access code to the trace distance between its two full-parity averages under approximate full-parity hiding.
References
This bound requires no commutation assumption on the parity averages and no lower bound on their nonzero eigenvalues. The argument leaves the optimal coefficient of $e$ and the classification of nearly optimal encodings undetermined.
— Exact value and rigidity of the $2\times3$ magic rectangle
(2610.12001 - Essayag et al., 8 Oct 2026) in Section 7, Proposition 7.3 and the paragraph following its proof; also stated in Section 9, Conclusion