Optimal odd-parity-oblivious random-access-code bounds
Determine the optimal decoding bounds for odd-parity-oblivious random-access codes beyond the three-bit full-parity case resolved in the paper.
References
They leave the optimal odd-parity-oblivious bounds as an open problem Sec.~1.1, arXiv v1.
— Exact value and rigidity of the $2\times3$ magic rectangle
(2610.12001 - Essayag et al., 8 Oct 2026) in Section 7, Optimal codes hiding the full input parity