Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

On the Hamming distance between two i.i.d. random n-tuples over a finite set

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Fang-Wei Fu ; Dept. of Math., Nankai Univ., Tianjin, China ; Klove, T. ; Shi-Yi Shen

We study the Hamming distance dH(X,Y) between two independent identical distributed (i.i.d.) random n-tuples X and Y over some finite set, both lower and upper bounds are derived for the expectation EdH(X,Y) and the variance DdH(X,Y). Also, a generalization of the Grey-Rankin bound is given

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 2 )