No label defined (Q3734307)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3965971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3965971 |
Statements
1986
0 references
binary cyclic codes
0 references
Gilbert bound
0 references
irreducible polynomials
0 references
0.7863419651985168
0 references
0.7820917367935181
0 references
0.767248809337616
0 references
0.7655333876609802
0 references
[For the entire collection see Zbl 0591.00035.] An upper bound is obtained on the number of polynomials that divide a polynomial of degree n over GF(2). If \(M_ n\) is the maximum number of such polynomials, over all polynomials of degree n, then it is shown for large n that \[ M_ n\quad \leq \quad \beta^{\frac{n}{2+\log_ 2n}[1+o(1)]}\quad where\quad \beta \quad \leq \quad 5.0625. \] It follows that \(\ln (M_ n)/n\) goes to zero for large n. This property is used to show that most binary shortened cyclic codes satisfy the Gilbert bound, extending an earlier result of \textit{T. Kasami} [IEEE Trans. Inf. Theory IT-15, 174-176 (1969; Zbl 0169.216)] valid only for codes generated by irreducible polynomials.
0 references