Article thumbnail

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance

By S. Litsyn and A. Tietäväinen


AbstractWe derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width. These bounds improve on the Delorme-Solé-Stokes bounds, and in a certain interval for binary linear codes they are also better than Tietäväinen's bound

Publisher: Published by Elsevier Ltd.
Year: 1996
DOI identifier: 10.1006/eujc.1996.0022
OAI identifier:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles