Über die Quadratwurzel-Schranke für quadratische-Rest-Codes. (On the square root bound for quadratic-residue codes)
The minimal distance d of any QR-Code of length \(n\equiv 3 mod 4\) over a prime field \(GF(p)\) with \(p\equiv 3 mod 4\) satisfies the improved square root bound \(d(3d-2)\geq 4(n-1).\)
scientific article; zbMATH DE number 4049544