MRRWMceliece-Rodemich-Rumsey-Welch (algorithms)
References in periodicals archive ?
Using the same argument and the first McEliese-Rumsey-Rodemich-Welsh (MRRW) bound ([HP], Theorem 2.10.6), we prove the following unconditional result.
Proof: If a prime p satisfies B(1:62; p) then we shall call it "admissible." We show that the statement "B(1:62; p) holds for all sufficiently large primes p for which p [equivalent to] 1 (mod 4)" contradicts the first asymptotic MRRW bound.
A similar argument (using h(x) and the MRRW bound in place of 1 * [H.sub.2](x) and the hypothetical Goppa bound) gives