Method of Four Russians Over Large Fields

We present a method of computing with matrices over very small finite fields of size larger than 2. We show how the method of Four Russians can be efficiently adapted to these larger fields, and introduce a row-wise matrix compression scheme that both reduces memory requirements and allows one to vectorize element operations. We also present some timings which indicate these methods equal [TODO are we uniformly better now?] or exceed the speed of the fastest implementations of linear algebra the authors are aware of