De Bruijn covering codes with arbitrary alphabets

DOI10.1016/j.aam.2004.05.004zbMath1077.94524OpenAlexW2062167828MaRDI QIDQ1775727

Van H. Vu

Publication date: 4 May 2005

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2004.05.004

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Unnamed Item
• Covering codes with improved density
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• New versions of Suen's correlation inequality

This page was built for publication: De Bruijn covering codes with arbitrary alphabets