C# (CSharp) zxingwp7.common.reedsolomon 네임스페이스

This class contains utility methods for performing mathematical operations over the Galois Field GF(256). Operations use a given primitive polynomial in calculations.

Throughout this package, elements of GF(256) are represented as an int for convenience and speed (but at the cost of memory). Only the bottom 8 bits are really used.

Represents a polynomial whose coefficients are elements of GF(256). Instances of this class are immutable.

Much credit is due to William Rucklidge since portions of this code are an indirect port of his C++ Reed-Solomon implementation.

Implements Reed-Solomon decoding, as the name implies.

The algorithm will not be explained here, but the following references were helpful in creating this implementation:

• Bruce Maggs. "Decoding Reed-Solomon Codes" (see discussion of Forney's Formula)
• J.I. Hall. "Chapter 5. Generalized Reed-Solomon Codes" (see discussion of Euclidean algorithm)

Much credit is due to William Rucklidge since portions of this code are an indirect port of his C++ Reed-Solomon implementation.

Implements Reed-Solomon enbcoding, as the name implies.

Thrown when an exception occurs during Reed-Solomon decoding, such as when there are too many errors to correct.