We consider a special case of the problem of computing the Galois group of a system of linear ordinary differential equations Y = M Y , M ∈ C(x) n×n . We assume that C is a computable, characteristic-zero, algebraically closed constant field with a factorization algorithm. There exists a decision pr
Type II Codes OverF4 + uF4
✍ Scribed by San Ling; Patrick Solé
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 145 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
A special class of self dual codes over an alphabet of size 16 which contains both F 4 and F 2 + uF 2 is studied. Applications to codes over these two alphabets and unimodular lattices (Gaussian, golden and integer) are given.
📜 SIMILAR VOLUMES
We investigate the periodic character and the global stability of solutions of the Ž . Ž . equation y s p q y r qy q y with positive parameters and positive initial conditions.
are presented. The proofs are based on the alternative method, a connectedness result, the contraction mapping principle, and a detailed analysis of the bifurcation equation utilizing, e.g., a generalization of the mean value theorem for integrals. We shall obtain results with g bounded or unbounded
It is shown that the
In this paper we investigate the global asymptotic stability of the recursive , n s 0, 1, . . . , where ␣, , ␥ G 0. We show that the unique positive equilibrium point of the equation is a global attractor with a basin that depends on the conditions posed on the coefficients.