A4 Article in conference proceedings
On covering radius and dual distance




List of Authors: Laihonen T
Publication year: 1998
Journal name in source: 1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND
Number of pages: 2
ISBN: 0-7803-4408-1

Abstract
We estimate the covering radius of a code when the dual distance is known. New bounds on covering radii of linear codes are derived. Also bounds for self-complementary and even-weight codes are presented.


Internal Authors/Editors

Last updated on 2019-19-07 at 19:44