AbstractIn this paper, we shall prove that there is no [3q4-q3-q2-3q-1,5,3q4-4q3-2q+1]q code over the finite field Fq for q⩾11. Thus, we conclude the nonexistence of a [gq(5,d),5,d]q code for 3q4-4q3-2q+1⩽d⩽3q4-4q3-q
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to c...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
AbstractRecently, Hamada and Deza (1988) and Hamada and Helleseth (in a submitted paper) characteriz...
We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k,...
We prove the non--existence of $[g_q(4,d),4,d]_q$ codes for $d=2q^3-rq^2-2q+1$ for $3 \le r \le (q+1...
AbstractLet nq(k,d) be the smallest integer n for which there exists a linear code of length n, dime...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
AbstractWe prove the nonexistence of linear codes with parameters [400,5,299]4, [401,5,300]4, [405,5...
Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractA classical binary Preparata code P2(m) is a nonlinear (2m+1,22(2m-1-m),6)-code, where m is ...
AbstractWe investigate codes meeting the Griesmer bound. The main theorem of this article is the gen...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to c...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
AbstractRecently, Hamada and Deza (1988) and Hamada and Helleseth (in a submitted paper) characteriz...
We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k,...
We prove the non--existence of $[g_q(4,d),4,d]_q$ codes for $d=2q^3-rq^2-2q+1$ for $3 \le r \le (q+1...
AbstractLet nq(k,d) be the smallest integer n for which there exists a linear code of length n, dime...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
AbstractWe prove the nonexistence of linear codes with parameters [400,5,299]4, [401,5,300]4, [405,5...
Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractA classical binary Preparata code P2(m) is a nonlinear (2m+1,22(2m-1-m),6)-code, where m is ...
AbstractWe investigate codes meeting the Griesmer bound. The main theorem of this article is the gen...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to c...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
AbstractRecently, Hamada and Deza (1988) and Hamada and Helleseth (in a submitted paper) characteriz...
DOI
Add to ORKG