Two remarks on a paper by Moreno and Kumar [binary Reed-Muller codes]
Author:
- 1 May 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (3) , 859-861
Abstract
O. Moreno and P.V. Kumar (IEEE Trans. Inform. Theory, vol.39, no.5, September 1993) showed how Deligne's theorem can be applied to coding theory. They studied certain subcodes of binary Reed-Muller codes and estimated the associated character sums over a field of q2 elements. They obtained bounds of the order 𝒪(q). The present paper shows that in one case one can improve the coefficient of q in the estimates. The author also shows that there is an error in Moreno and Kumar's argument and in some cases one needs need to replace a bound of the order 𝒪(q) by a weaker bound of the order 𝒪(q 3/2)Keywords
This publication has 2 references indexed in Scilit:
- Minimum distance bounds for cyclic codes and Deligne's theoremIEEE Transactions on Information Theory, 1993
- Crosscorrelation properties of pseudorandom and related sequencesProceedings of the IEEE, 1980