Fragile watermarking using finite field trigonometrical transforms
Image Communication
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
One-error linear complexity over Fp of Sidelnikov sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Linear complexity over Fp of ternary Sidel’nikov sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Joint source-channel coding as an element of a QoS framework for '4G' wireless multimedia
Computer Communications
Description of Minimum Weight Codewords of Cyclic Codes by Algebraic Systems
Finite Fields and Their Applications
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
| Hi-index | 0.00 |
By using the theory of finite field Fourier transforms, the subject of error control codes is described in a language familiar to the field of signal processing. The many important uses of spectral techniques in error control are summarized. Many classes of linear codes are given a spectral interpretation and some new codes are describe. Several alternative encoder/ decoder schemes are described by frequency domain reasoning. In particular, an errors-and-erasures decoder for a BCH code is exhibited which has virtually no additional computations over an errors-only decoder. Techniques for decoding BCH, RS, and alternant codes (Goppa codes) a short distance beyond the designed distance are discussed. Also, a modification to the definition of a BCH code is described which reduces the decoder complexity without changing the code's rate or minimum distance.