AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minimum integer n for which there exists a linear code of length n, dimension k and minimum Hamming distance d over the Galois field GF(q). As a result for the nonprojective linear codes, we prove the nonexistence of an [n,4,2q3−rq2−q+1]q code attaining the Griesmer bound for q>r,r=3,4, and for q>2(r−1),r⩾3
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
AbstractWe prove the nonexistence of linear codes with parameters [400,5,299]4, [401,5,300]4, [405,5...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
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...
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to c...
AbstractLet nq(k,d) be the smallest integer n for which there exists a linear code of length n, dime...
AbstractWe investigate codes meeting the Griesmer bound. The main theorem of this article is the gen...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k,...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
AbstractIn this paper, we shall prove that there is no [3q4-q3-q2-3q-1,5,3q4-4q3-2q+1]q code over th...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
AbstractWe prove the nonexistence of linear codes with parameters [400,5,299]4, [401,5,300]4, [405,5...
In coding theory, the problem of finding the shortest linear codes for a fixed set of parameters is ...
AbstractValues and lower bounds for nq(4,d) for general q are given, where nq(k,d) denotes the minim...
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...
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to c...
AbstractLet nq(k,d) be the smallest integer n for which there exists a linear code of length n, dime...
AbstractWe investigate codes meeting the Griesmer bound. The main theorem of this article is the gen...
AbstractLet n4(k,d) be the minimum length of a linear [n,k,d] code over GF(4) for given values of k ...
We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k,...
AbstractEvery linear code over GF(4) with odd minimum distance d is extendable if Ai=0 for all i≡2(m...
AbstractIn this paper, we shall prove that there is no [3q4-q3-q2-3q-1,5,3q4-4q3-2q+1]q code over th...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractThe relation between the extendability of linear codes over GF(q) having the minimum distanc...
DOI
Add to ORKG