The authors extend to the q-ary case the notions of a normal code, a subnormal code, and the amalgamated direct sum construction, in order to investigate problems related to the covering radius of codes. For example, the authors prove that every nonbinary nontrivial perfect code is absubnormal. They also include some linear-programming lower bounds on ternary codes with covering radius 2 or 3
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
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...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
AbstractWe show that if q ≠ 3 is a prime power and there exists a (q, n, M) 1 code, i.e., a q-ary co...
AbstractLet kq(n) denote the minimal cardinality of a q-ary code C of length n and covering radius o...
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
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 ...
AbstractWe show that if q ≠ 3 is a prime power and there exists a (q, n, M) 1 code, i.e., a q-ary co...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
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...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
AbstractWe show that if q ≠ 3 is a prime power and there exists a (q, n, M) 1 code, i.e., a q-ary co...
AbstractLet kq(n) denote the minimal cardinality of a q-ary code C of length n and covering radius o...
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
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 ...
AbstractWe show that if q ≠ 3 is a prime power and there exists a (q, n, M) 1 code, i.e., a q-ary co...
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
AbstractWe introduce a new approach which facilitates the calculation of the covering radius of a bi...
The minimum number of codewords in a code with t ternary and b binary coordinates and covering radi...
DOI
Add to ORKG