We consider ann-dimensional vector space overGF(q)which has a probability distribution defined on it. The sum of the probabilities over a properk-dimensional subspace is compared to a sum over a coset of this subspace. The difference of these set probabilities is related to a sum of the Fourier transforms of the distribution over a subset of the domain of the transforms. We demonstrate the existence of a coset and both an upper and a lower bound on the difference associated with this coset. The bounds depend on the maximum and nonzero minimum of the transforms as defined on a special subset of the transform domain. Two examples from coding theory are presented. The first deals with aq-ary symmetric channel while the second is concerned with a binary compound channel.
Published in:
Information Theory, IEEE Transactions on
(Volume:19
,
Issue:
4
)
Date of Publication:
Jul 1973
- Page(s):
-
533
-
536
- ISSN :
-
0018-9448
- Digital Object Identifier :
-
10.1109/TIT.1973.1055035
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 January 2003
- Issue Date :
-
Jul 1973
- Sponsored by :
-
IEEE Information Theory Society