| Coding Theory Group (2008) | |||||||||||||
Abstract | |||||||||||||
| Abstract We derive a new upper bound on the covering radius of a code as a function of its dual distance. This bound improves on the Honkala-Litsyn-Tiet"av"ainen bound and in a certain interval it is also better than Tiet"av"ainen's bound. TUCS Research Group | |||||||||||||
Publication details | |||||||||||||
| |||||||||||||