On proposition and comparison of trace computation methods in finite field \(GF(2^m)\) (Q2721581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On proposition and comparison of trace computation methods in finite field \(GF(2^m)\) |
scientific article; zbMATH DE number 1616253
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On proposition and comparison of trace computation methods in finite field \(GF(2^m)\) |
scientific article; zbMATH DE number 1616253 |
Statements
4 May 2002
0 references
finite fields
0 references
trace computation
0 references
0.86455333
0 references
0.85873884
0 references
0 references
0.85462236
0 references
0.85454756
0 references
0.8522494
0 references
0.8498436
0 references
On proposition and comparison of trace computation methods in finite field \(GF(2^m)\) (English)
0 references
The paper compares various algorithms for computing traces in the finite field \(GF(2^m)\). Irreducible trinomials are used to construct \(GF(2^m)\), and a simulation is run for \(m \leq 1000\). The so-called Improved Trace Algorithm, defined in this paper, outperforms the Newton Formula Algorithm in this simulation. Possible applications to chip design and the decoding of Reed-Solomon codes are discussed.
0 references
