Bounds on the sizes of constant weight covering codes
From MaRDI portal
Publication:1804978
DOI10.1007/BF01388385zbMath0816.94026OpenAlexW2062460958MaRDI QIDQ1804978
Zhen Zhang, Tuvi Etzion, Victor K. Wei
Publication date: 20 July 1995
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01388385
covering radiusdata compressionboundsquantization errorasymptotic covering densityconstant weight covering codes
Related Items (7)
Upper bounds on the general covering numberCλ(v,k,t,m) ⋮ A tabu search algorithm for the covering design problem ⋮ Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four ⋮ Asymptotic Bounds for General Covering Designs ⋮ New coverings oft-sets with (t + 1)-sets ⋮ General upper bounds on the minimum size of covering designs ⋮ Large sets of coverings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for football pool problems and mixed covering codes
- Minimal coverings of pairs by triples
- On large sets of disjoint Steiner triple systems. IV
- On large sets of disjoint Steiner triple systems. I
- A note on the probabilistic approach to Turan's problem
- On a packing and covering problem
- Covering triples by quadruples: an asymptotic solution
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
- On coverings
- A new table of constant weight codes
- New lower bounds for constant weight codes
- Covering radius---Survey and recent results
- Lower bounds for constant weight codes
- Source coding theorems without the ergodic assumption
- Construction of Large Sets of Almost Disjoint Steiner Triple Systems
- Large sets of coverings
- Modified bounds for covering codes
- On Lindelöf's conjecture
This page was built for publication: Bounds on the sizes of constant weight covering codes
