Covering radius and dual distance
type: Item
instance of: scholarly article
title: Covering radius and dual distance
zbMATH Open document ID: 0734.94020
DOI: 10.1007/BF00123957
published in: Designs, Codes and Cryptography
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 94B75
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 4215890
zbMATH Keywords: covering radius
zbMATH Keywords: dual distance
zbMATH Keywords: finite abelian group
author: Aimo Tietäväinen
MaRDI profile type: Publication
cites work: Linear programming bounds for tree codes (Corresp.)
cites work: Q3936653
cites work: On the coveting radius of extremal self-dual codes
cites work: Four fundamental parameters of a code and their combinatorial significance
cites work: On the covering radius of binary codes (Corresp.)
cites work: An optimal polynomial for a covering radius problem
cites work: Q3946078
cites work: Q3495048
cites work: Q4146667
cites work: An upper bound for self-dual codes
cites work: Weight congruence for p-ary cyclic codes
cites work: Exponential sums and Goppa codes. II
cites work: Q3996427
cites work: Asymptotic bounds on the covering radius of binary codes
cites work: Generalization of the Norse bounds to codes of higher strength
cites work: An upper bound on the covering radius as a function of the dual distance
cites work: Q3835417
full work available at URL: https://doi.org/10.1007/bf00123957
OpenAlex ID: W148590762
description: scientific article; zbMATH DE number 4215890