Add to ORKGIn this paper we introduce the class of covering radius (CR)-codes as a generalization of greedy codes. First we show how a CR-code is constructed and introduce some basic terminology. Some properties which are satisfied by these codes are then discussed. We review the property of normality for codes and show that CR-codes with minimum distance at most 8 are normal.
According to the experiences, it is a known fact that some essential features of normal codes are qu...
The purpose of this paper is to discuss some recent generalizations of the basic covering radius pro...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
AbstractThis paper gives a lower bound and an upper bound for the covering radius of optimum codes. ...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
The covering radius of a code is the least r such that the set of balls of radius r around codewords...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
The strength and the covering radius of a binary self-complementary code are studied under different...
[[abstract]]In this paper, we restudy the covering radius of block codes from an information theoret...
According to the experiences, it is a known fact that some essential features of normal codes are qu...
The purpose of this paper is to discuss some recent generalizations of the basic covering radius pro...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
AbstractThis paper gives a lower bound and an upper bound for the covering radius of optimum codes. ...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
The covering radius of a code is the least r such that the set of balls of radius r around codewords...
AbstractWe present a uniform approach towards deriving upper bounds on the covering radius of a code...
The strength and the covering radius of a binary self-complementary code are studied under different...
[[abstract]]In this paper, we restudy the covering radius of block codes from an information theoret...
According to the experiences, it is a known fact that some essential features of normal codes are qu...
The purpose of this paper is to discuss some recent generalizations of the basic covering radius pro...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...