Raymond Toy <toy@rtp.ericsson.se> wrote:
+---------------
| rpw3@rigden.engr.sgi.com (Rob Warnock) writes:
| >> So GF(256) can be done reasonably fast, even without 64 KB lookup
| >> tables...
|
| GF(256) only has 256 elements. Why do you need a 64KB lookup?
+---------------
Consider this alterative to the log-add-antilog method:
(defun gf256-multiply (x y)
(svref gf256-multiply-table (+ (* 256 x) y)))
How big is "gf256-multiply-table"?
-Rob
-----
Rob Warnock, 8L-855 rpw3@sgi.com
Applied Networking http://reality.sgi.com/rpw3/
Silicon Graphics, Inc. Phone: 650-933-1673
2011 N. Shoreline Blvd. FAX: 650-964-0811
Mountain View, CA 94043 PP-ASEL-IA