Über die Quadratwurzel-Schranke für quadratische-Rest-Codes. (On the square root bound for quadratic-residue codes) (Q1102256)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Über die Quadratwurzel-Schranke für quadratische-Rest-Codes. (On the square root bound for quadratic-residue codes) |
scientific article; zbMATH DE number 4049544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Über die Quadratwurzel-Schranke für quadratische-Rest-Codes. (On the square root bound for quadratic-residue codes) |
scientific article; zbMATH DE number 4049544 |
Statements
Über die Quadratwurzel-Schranke für quadratische-Rest-Codes. (On the square root bound for quadratic-residue codes) (English)
0 references
1988
0 references
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).\)
0 references
0.9225067496299744
0 references
0.8210834860801697
0 references
0.801306962966919
0 references
