AbstractWe show that if q ≠ 3 is a prime power and there exists a (q, n, M) 1 code, i.e., a q-ary code of length n with M codewords and covering radius 1 then there exists also a (q, 1)-subnormal (q, qn + 1, q(q-1)nM)1 code. We also show that all nontrivial linear q-ary codes with covering radius 1 are (q, 1)-subnormal with the exception of the ternary [4, 2]1 Hamming code
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
AbstractLet Ω be a set of q symbols and Ωn={x1…xn|xi∈Ω}. We prove that for any fixed q and R, there ...
AbstractLet C be a q-ary covering code with covering radius one. We give lower and upper bounds for ...
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...
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...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
We study codes with parameters of $q$-ary shortened Hamming codes, i.e., $(n=(q^m-q)/(q-1), q^{n-m},...
AbstractWe introduce a new infinite family of quaternary cyclic (n, (n+1)2) and (n, (n − 1)2) codes ...
Subfield codes of linear codes over finite fields have recently received a lot of attention, as some...
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
AbstractLet Ω be a set of q symbols and Ωn={x1…xn|xi∈Ω}. We prove that for any fixed q and R, there ...
AbstractLet C be a q-ary covering code with covering radius one. We give lower and upper bounds for ...
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...
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...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
AbstractWe prove that if a binary code has covering radius one then it is subnormal
We study codes with parameters of $q$-ary shortened Hamming codes, i.e., $(n=(q^m-q)/(q-1), q^{n-m},...
AbstractWe introduce a new infinite family of quaternary cyclic (n, (n+1)2) and (n, (n − 1)2) codes ...
Subfield codes of linear codes over finite fields have recently received a lot of attention, as some...
AbstractA binary code C of length n is called a μ-fold r-covering if every binary word of length n i...
AbstractLet Ω be a set of q symbols and Ωn={x1…xn|xi∈Ω}. We prove that for any fixed q and R, there ...
AbstractLet C be a q-ary covering code with covering radius one. We give lower and upper bounds for ...
DOI
Add to ORKG