The dependency on HaskellForMaths turned out to be not a wise choice. Even though it provides an implementation of field extensions (finite fields with non-prime order), the implementation does not seem to be clean and not in the same spirit as linear-codes (e.g. reimplementation of GHC.TypeLits.Nat). Also, the library seems to be abandoned.
There are two options:
Create own implementation of field extensions, maybe even with optimisQed algorithms for 2^k
The dependency on HaskellForMaths turned out to be not a wise choice. Even though it provides an implementation of field extensions (finite fields with non-prime order), the implementation does not seem to be clean and not in the same spirit as linear-codes (e.g. reimplementation of GHC.TypeLits.Nat). Also, the library seems to be abandoned. There are two options: