AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, the nonexistence of [105,6,68]3 and [230,6,152]3 codes is proved
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
An [n,k, dh-code is a ternary linear code with length n, dimension k and minimum distance d. We prov...
Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $...
Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
An [n,k, dh-code is a ternary linear code with length n, dimension k and minimum distance d. We prov...
Let $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ ...
Let $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ ...
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...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
AbstractLet [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance...
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
An [n,k, dh-code is a ternary linear code with length n, dimension k and minimum distance d. We prov...
Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $...
Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
An [n,k, dh-code is a ternary linear code with length n, dimension k and minimum distance d. We prov...
Let $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ ...
Let $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ ...
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...
AbstractWe prove the existence of a [406,6,270]3 code and the nonexistence of linear codes with para...
Let [n; k; d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over ...
AbstractLet [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance...
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
AbstractLet nq(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It ...
AbstractThe diversity (Φ0,Φ1) of a ternary [n,k,d] code C with d≡1 or 2(mod3), k⩾3, is defined by Φ0...
DOI
Add to ORKG