On covering radius and dual distance



: Laihonen T

: 1998

: 1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND

: 53

: 54

: 2

: 0-7803-4408-1

DOI: https://doi.org/10.1109/ITW.1998.706420


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.



Last updated on 2024-26-11 at 23:23