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.

Background

The paper studies three-bit random-access codes in which the full input parity is hidden, while two-bit parities may remain observable. It proves the optimal average decoding probability for this three-bit model in arbitrary finite encoding dimension and classifies all optimal encodings.

The authors note that the broader optimal odd-parity-oblivious bounds had previously been left unresolved. This is included because the passage explicitly identifies that problem as open, even though the paper settles the specific three-bit instance under consideration.

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