Title :
On the Hamming distance between two i.i.d. random n-tuples over a finite set
Author :
Fu, Fang-Wei ; Kløve, Torleiv ; Shen, Shi-Yi
Author_Institution :
Dept. of Math., Nankai Univ., Tianjin, China
fDate :
3/1/1999 12:00:00 AM
Abstract :
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
Keywords :
encoding; group theory; random processes; Grey-Rankin bound generalization; Hamming distance; coding theory; expectation; finite set; group algebra; i.i.d. random n-tuples; independent identical distributed random n-tuples; lower bound; upper bound; variance; Algebra; Codes; Councils; Hamming distance; Informatics; Mathematics; Probability distribution; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
