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

DOI10.1109/18.749033zbMath0945.94030OpenAlexW2147865489MaRDI QIDQ4701337

Shi-Yi Shen, Fang-Wei Fu, Torleiv Kløve

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

boundsvarianceHamming distanceGrey-Rankin boundexpectationcodesAlthöfer-Sillke inequalityrandom \(n\)-tuples

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (5)

Unnamed Item ⋮ The Grey-Rankin bound for nonbinary codes ⋮ On the minimum average distance of binary constant weight codes ⋮ On the minimum average distance of binary codes: Linear programming approach ⋮ 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