Safe Haskell | None |
---|---|
Language | Haskell2010 |
Table of Conway polynomials
The data is from http://www.math.rwth-aachen.de/~Frank.Luebeck/data/ConwayPol/index.html
Synopsis
- data ConwayPoly (p :: Nat) (m :: Nat)
- data SomeConwayPoly = forall p m. SomeConwayPoly (ConwayPoly p m)
- conwayPrime :: ConwayPoly p m -> IsSmallPrime p
- conwayDim :: ConwayPoly p m -> Int
- conwayParams :: ConwayPoly p m -> (Int, Int)
- conwayParams' :: ConwayPoly p m -> (SNat64 p, SNat64 m)
- conwayCoefficients :: ConwayPoly p m -> [Word64]
- lookupSomeConwayPoly :: Int -> Int -> Maybe SomeConwayPoly
- lookupConwayPoly :: SNat64 p -> SNat64 m -> Maybe (ConwayPoly p m)
- unsafeLookupConwayPoly :: SNat64 p -> SNat64 m -> ConwayPoly p m
- lookupConwayPrimRoot :: Int -> Maybe Int
Documentation
data ConwayPoly (p :: Nat) (m :: Nat) Source #
Instances
Show (ConwayPoly p m) Source # | |
Defined in Math.FiniteField.Conway showsPrec :: Int -> ConwayPoly p m -> ShowS # show :: ConwayPoly p m -> String # showList :: [ConwayPoly p m] -> ShowS # |
data SomeConwayPoly Source #
forall p m. SomeConwayPoly (ConwayPoly p m) |
Instances
Show SomeConwayPoly Source # | |
Defined in Math.FiniteField.Conway showsPrec :: Int -> SomeConwayPoly -> ShowS # show :: SomeConwayPoly -> String # showList :: [SomeConwayPoly] -> ShowS # |
conwayPrime :: ConwayPoly p m -> IsSmallPrime p Source #
The prime characteristic p
conwayDim :: ConwayPoly p m -> Int Source #
The dimension m
of F_q
over F_p
conwayParams :: ConwayPoly p m -> (Int, Int) Source #
The pair (p,m)
conwayParams' :: ConwayPoly p m -> (SNat64 p, SNat64 m) Source #
conwayCoefficients :: ConwayPoly p m -> [Word64] Source #
lookupSomeConwayPoly :: Int -> Int -> Maybe SomeConwayPoly Source #
Usage: lookupSomeConwayPoly p m
for q = p^m
lookupConwayPoly :: SNat64 p -> SNat64 m -> Maybe (ConwayPoly p m) Source #
Usage: lookupConwayPoly sp sm
for q = p^m
unsafeLookupConwayPoly :: SNat64 p -> SNat64 m -> ConwayPoly p m Source #
lookupConwayPrimRoot :: Int -> Maybe Int Source #
We have some Conway polynomials for m=1
too; the roots of
these linear polynomials are primitive roots in F_p
Orphan instances
Show (ConwayPoly p m) Source # | |
showsPrec :: Int -> ConwayPoly p m -> ShowS # show :: ConwayPoly p m -> String # showList :: [ConwayPoly p m] -> ShowS # |