Skip to content

Comment on Finite Field Arithmetic and Reed-Solomon Codingparent

Comments

I misread his statement and made it conform to what I know to be true. There is a finite field of size 256, and you could enumerate the elements in the field with all numbers mod 256, but the normal *,+ wouldn't work persay. The inverse of 2 could be any of the other numbers in the field, even itself. Should have been more careful; I usually try to avoid talking about Math on the internet.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.