It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves a conjecture of Cohen, Lobstein, and Sloane (1986). It is also proved that codes with minimal distance 2R or 2R+1 are normal. A generalization of Frankl's construction (1987) of abnormal codes is given
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
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 ...
According to the experiences, it is a known fact that some essential features of normal codes are qu...
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
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...
In this paper we introduce the class of covering radius (CR)-codes as a generalization of greedy cod...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
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 ...
According to the experiences, it is a known fact that some essential features of normal codes are qu...
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
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...
In this paper we introduce the class of covering radius (CR)-codes as a generalization of greedy cod...
AbstractA binary code with covering radius R is a subset C of the hypercube Qn={0,1}n such that ever...
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgam...
DOI
Add to ORKG