Comments on the recent improvements of the MRRW bounds

2026-09-01

AI Summary

该文探讨了近期对MRRW界限的改进，通过两种不同方法（Delsarte证书与经典-量子信道）解释了为何能获得相同的界限。

Abstract

The asymptotic McEliece--Rodemich--Rumsey--Welch bound (1977) limits the largest attainable rate of binary codes as a function of the relative distance. After a nearly half-century hiatus, this result was recently improved in two concurrent works, by OpenAI and by O. Alrabiah and V. Guruswami. The two arguments look entirely different, a Delsarte certificate on the one hand, a classical-quantum channel and the pretty good measurement on the other, and they yield the same bound. The purpose of this note is to explain why: in both proofs, a subspace is attached to every codeword and moved with it, and the bound counts how many such subspaces fit in the ambient space, exactly in the first case and in the probabilistic sense of typicality in the second. We also present the OpenAI proof in the language and context of coding theory, as an extension of the spectral method in which the single vector attached to a codeword is replaced by a subspace.

Problem

• MRRW bounds
• binary codes
• relative distance
• Delsarte certificate
• classical-quantum channel

Innovation

• Delsarte certificate
• classical-quantum channel
• pretty good measurement
• subspace association
• spectral method extension