1. Blahut R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, Reading (1983)
2. Borodin A., Munro I.: The Computational Complexity of Algebraic and Numeric Problems. Elsevier, New York (1975)
3. Costa E., Fedorenko S.V., Trifonov P.V.: On computing the syndrome polynomial in Reed-Solomon decoder. Eur. Trans. Telecommun. 15(4), 337–342 (2004)
4. Elia M., Leone M.: On the inherent space complexity of fast parallel multipliers for GF(2 m ). IEEE Trans. Comput. 51(3), 346–351 (2002)
5. Interlando, J.C., Byrne, E., Rosenthal, J.: The gate complexity of syndrome decoding of Hamming codes. In: Proceeding of 10th International Conference on Applications of Computer Algebra, pp. 33–37 (2004)