The asymptotic behaviour of diameters in the average

DOI10.1006/JCTB.1994.1042MaRDI QIDQ1333337zbMATH OpenOpenAlexFDO

Authors Ingo Althöfer, Rudolf Ahlswede

Publication date 17 May 1995

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1994.1042

zbMATH Keywords

average distance problem

Mathematics Subject Classification ID

Mathematical programming (90C99)

Recommendations

• Further results on the asymptotic behaviour of minimum average Hamming distance for binary codes
• Minimum average distance subsets in the Hamming cube
• Lower bounds on the minimum average distance of binary codes
• An ``average distance inequality for large subsets of the cube

Cited in

(13)

• On the average Hamming distance for binary codes
• Lower bounds on the minimum average distance of binary codes
• Asymptotic behavior of average \(L_p\)-discrepancies
• Average distance and minimum average distance of binary constant weight code and its properties
• Sets of binary sequences with small total Hamming distances
• Models of multi-user write-efficient memories and general diametric theorems
• On the variance of average distance of subsets in the Hamming space
• Minimum average distance subsets in the Hamming cube
• On the minimum average distance of binary codes: Linear programming approach
• Asymptotics of the average height of 2-watermelons with a wall
• On the minimum average distance of binary constant weight codes
• Further results on the asymptotic behaviour of minimum average Hamming distance for binary codes
• Asymptotic behaviour for the averaged height of Heegner points

This page was built for publication: The asymptotic behaviour of diameters in the average

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