Fix a finite commutative ring R. Let u and v be power series over R, with v(0) = 0. This paper presents an algorithm that computes the first n terms of the composition u(v), given the first n terms of u and v, in n 1+o(1) ring operations. The algorithm is very fast in practice when R has small chara
โฆ LIBER โฆ
Composing power series over finite rings. JSC 1998
โ Scribed by Bernstein.
- Book ID
- 127399568
- Tongue
- English
- Weight
- 28 KB
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Composing Power Series Over a Finite Rin
โ
Daniel J. Bernstein
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 261 KB
Self-Dual Permutation Codes Over Formal
โ
ZHANG, Guanghui; LIU, Hongwei
๐
Article
๐
2013
๐
Elsevier Science
๐
English
โ 276 KB
Cyclic codes over formal power series ri
โ
Steven T. Dougherty; Liu Hongwei
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 215 KB
Power series rings over globalized pseud
โ
Florida Girolami
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 754 KB
Power Series Over an Ascending Chain of
โ
Hizem, Sana
๐
Article
๐
2012
๐
Taylor and Francis Group
๐
English
โ 190 KB
Flat Power Series over a Finite Field
โ
A. Lasjaunias; J.-J. Ruch
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 192 KB
We define and describe a class of algebraic continued fractions for power series over a finite field. These continued fraction expansions, for which all the partial quotients are polynomials of degree one, have a regular pattern induced by the Frobenius homomorphism.This is an extension, in the case