The problem of finding the values of Aq(n, d)-the maximum size of a code of length n and minimum distance d over an alphabet of q elements- is considered. When q ≤ M < 2q, all parameters for which Aq(n, d) = M are determined. Methods for obtaining upper and lower bounds on A4(n, d) are discussed.</p
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
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...
AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of ...
This bachelor thesis is about binary error-correcting codes. A binary code is a collection words wit...
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...
AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of ...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
We consider the problem of finding values of A3(n, d), i.e. the maximal size of a ternary code of le...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
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...
AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of ...
This bachelor thesis is about binary error-correcting codes. A binary code is a collection words wit...
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...
AbstractWe consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of ...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
We consider the problem of finding values of A3(n, d), i.e. the maximal size of a ternary code of le...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish f...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...