AbstractThe paper is devoted to a study of the packing radius and the covering radius of a well-known equal-weight code. Under some conditions tight estimates or exact values of these parameters are obtained
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractLet Hm be the binary linear block code with parity-check matrix Hm whose columns are all dis...
AbstractThe paper is devoted to a study of the packing radius and the covering radius of a well-know...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. The cover...
AbstractThis paper gives a lower bound and an upper bound for the covering radius of optimum codes. ...
AbstractIn the present paper we develop a method to determine the coset weight distributions and cov...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. We establ...
AbstractWe derive new upper bounds on the covering radius of a binary linear code as a function of i...
We survey important developments in the theory of covering radius during the period 1985-1994. We pr...
We survey important developments in the theory of covering radius during the period 1985-1994. We pr...
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
The list-decodable code has been an active topic in theoretical computer science.There are general r...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractLet Hm be the binary linear block code with parity-check matrix Hm whose columns are all dis...
AbstractThe paper is devoted to a study of the packing radius and the covering radius of a well-know...
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. The cover...
AbstractThis paper gives a lower bound and an upper bound for the covering radius of optimum codes. ...
AbstractIn the present paper we develop a method to determine the coset weight distributions and cov...
AbstractThe Newton radius of a code is the largest weight of a uniquely correctable error. We establ...
AbstractWe derive new upper bounds on the covering radius of a binary linear code as a function of i...
We survey important developments in the theory of covering radius during the period 1985-1994. We pr...
We survey important developments in the theory of covering radius during the period 1985-1994. We pr...
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
The list-decodable code has been an active topic in theoretical computer science.There are general r...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractLet Hm be the binary linear block code with parity-check matrix Hm whose columns are all dis...
DOI
Add to ORKG