Strong approximations of the Q-Q process
β Scribed by Emad-Eldin A.A. Aly
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 633 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Beginning with an improvement to Dirichlet's Theorem on simultaneous approximation, in this paper we introduce an alogrithm, in sympathy with the classical continued fraction algorithm, to generate the sequence of best approximates to the system max[&: 0 n&, &: 1 n&, ..., &: L n&] in the case when :
It is unknown whether or not there exists an [87, 5, 57 ; 31-code. Such a code would meet the Griesmer bound. The purpose of this paper is to give a constructive proof of the existence of [q4 + q2 \_ q, 5, q'\* -q3 + q2 \_ 2q; q]-codes for any prime power q \_> 3. As a special case, it is shown that
## DATTA AND MALLIK Fe 2q and 134 and 181 s in the presence of Fe 2q . These are in good agreement with the observed values which are f 100 and f 200 s when Fe 2q is present in the matrix and which are known to be almost twice as large when the Fe 2q is evicted from the matrix. The present work als