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

DOI10.1109/18.749033MaRDI QIDQ4701337zbMATH OpenOpenAlexFDO

Authors Fangwei Fu, Torleiv Kløve, Shi-Yi Shen

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.749033

zbMATH Keywords

Hamming distancevarianceboundscodesexpectationGrey-Rankin boundAlthöfer-Sillke inequalityrandom \(n\)-tuples

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• On the expectation and variance of Hamming distance between two i. i. d. random vectors
• On the variance of average distance of subsets in the Hamming space
• scientific article; zbMATH DE number 4218374
• scientific article; zbMATH DE number 2123381

Cited in

(6)

• The Grey-Rankin bound for nonbinary codes
• On the variance of average distance of subsets in the Hamming space
• On the minimum average distance of binary codes: Linear programming approach
• On the minimum average distance of binary constant weight codes
• On equidistant constant weight codes
• On equidistant constant weight codes

This page was built for publication: On the Hamming distance between two i.i.d. random n-tuples over a finite set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701337)