The multicovering radius problem for some types of discrete structures

DOI10.1007/s10623-012-9755-6zbMath1333.94075arXiv1112.1872OpenAlexW2048826116MaRDI QIDQ2248636

Alan J. Aw

Publication date: 27 June 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.1872

zbMATH Keywords

coding theoryprobabilistic methodsLovasz local lemmamulti-covering radius

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

The covering radius problem for sets of 1-factors of the complete uniform hypergraphs ⋮ Covering radius in the Hamming permutation space

Cites Work

• A random construction for permutation codes and the covering radius
• Covering radius for sets of permutations
• Multi-covering radius for rank metric codes
• The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
• A survey on packing and covering problems in the Hamming permutation space
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Covering radius---Survey and recent results
• The multicovering radii of codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The multicovering radius problem for some types of discrete structures