Correlation Parameters for Periodic Sequences -- Properties, Bounds, and Efficient Computational Methods

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / DAAB-07-72-C-025

Polynomial evaluation over finite fields: new algorithms and complexity bounds

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation in the decoding of Reed-Solomon codes are highlighted.Comment: accepted for publication in Applicable Algebra in Engineering, Communication and Computing. The final publication will be available at springerlink.com. DOI: 10.1007/s00200-011-0160-

Computational Complexity of Fourier Transforms over Finite Fields

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / DAAB-07-72-C-0259National Science Foundation / GK-24879 and MCS 76-1732

Computational Complexity of Fourier Transforms over Finite Fields

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / DAAB-07-72-C-0259National Science Foundation / GK-24879 and MCS 76-1732