AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of a code of length n and minimum distance d over an alphabet of 5 elements. Using a wide variety of constructions and methods, a table of bounds on A5(n,d) for n⩽11 is obtained
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
We give a new upper bound on the maximum size $A_q(n,d)$ of a code of word length $n$ and minimum Ha...
We give a new upper bound on the maximum size $A_q(n,d)$ of a code of word length $n$ and minimum Ha...
AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of ...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
For nonnegative integers q, n, d, let Aq(n, d) denote the maximum cardinality of a code of length n...
Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most...
Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most...
We consider the problem of finding values of A3(n, d), i.e. the maximal size of a ternary code of le...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
We give a new upper bound on the maximum size $A_q(n,d)$ of a code of word length $n$ and minimum Ha...
We give a new upper bound on the maximum size $A_q(n,d)$ of a code of word length $n$ and minimum Ha...
AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of ...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum dis...
For nonnegative integers q, n, d, let Aq(n, d) denote the maximum cardinality of a code of length n...
Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most...
Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most...
We consider the problem of finding values of A3(n, d), i.e. the maximal size of a ternary code of le...
AbstractLet [n,k,d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d o...
AbstractLet n4(k, d) be the smallest integer n, such that a quaternary linear [n, k, d]-code exists....
AbstractWe show that a code C of length n over an alphabet Q of size q with minimum distance 2 and c...
We give a new upper bound on the maximum size $A_q(n,d)$ of a code of word length $n$ and minimum Ha...
We give a new upper bound on the maximum size $A_q(n,d)$ of a code of word length $n$ and minimum Ha...
DOI
Add to ORKG