Answers are grounded in this paper and cite their sources.
Infinite families of linear binary codes with covering radius R=2 and minimum distance d=3 and d=4 are given. Using the constructed codes with d=3, R=2, families of covering codes with R>2 are obtained. The parameters of many constructed codes with R>
No takes yet. Share an insight, caveat, or question.
Gabidulin et al. (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: