On covering radius lower bound for a class of binary codes
type: Item
instance of: scholarly article
title: On covering radius lower bound for a class of binary codes
zbMATH Open document ID: 0844.94017
author: S. I. Chechëta
published in: Russian Mathematics
publication date: 1995-09-17T00:00:00Z
review text: The main result is a theorem on doubly exponential limit distribution of the Hamming distance from a random vector to the nearest codeword in a given binary code. From the obtained results lower bounds on the covering radius of certain binary linear codes can be given. The proof of the main result is not given in the paper but in order to give a proof the author claims that he can use a technique suggested in one of the references.
reviewed by: Tor Helleseth
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 794590
zbMATH Keywords: Hamming distance
zbMATH Keywords: binary code
zbMATH Keywords: lower bounds
zbMATH Keywords: covering radius
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 794590