4 search results - page 1 / 1 » Composing Power Series Over a Finite Ring in Essentially Lin... |
JSC
1998
13 years 4 months ago
1998
MOC
2000
13 years 5 months ago
2000
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over ...
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
TIT
2011
13 years 6 days ago
2011
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...