Learn More
— Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions.
A new uniquely decodable (UD) code pair for the two-user binary adder channel (BAC) is presented. This code pair leads to an improved bound for the zero-error capacity region of such a channel. The highest known rate for a UD code pair for the two-user BAC is thereby improved to (log/sub 2/240)/6/spl ap/1.3178. It is also demonstrated that the problem of(More)
The problem of nding the maximum radius of n non-overlapping equal circles in a unit square is considered. A computer-aided method for proving global optimality of such packings is presented. This method is based on recent results by De Groot, Monagan, Peik-ert, and WWrtz. As an example, it is shown how the method can be used to get an optimality proof for(More)
A set of points, S ⊆ P G(r, q), is said to be-saturating if, for any point x ∈ P G(r, q), there exist + 1 points in S that generate a subspace in which x lies. The cardinality of a smallest possible set S with this property is denoted by k(r, q,). We give a short survey of what is known about k(r, q, 1) and present new results for k(r, q, 2) for small(More)
A binary code <i>C</i> &#x2286; F<sub>2</sub><i>n</i> with minimum distance at least <i>d</i> and codewords of Hamming weight <i>w</i> is called an <i>(n</i>,<i>d</i>,<i>w</i>) constant weight code. The maximum size of an <i>(n</i>,<i>d</i>,<i>w</i>) constant weight code is denoted by <i>A</i>(<i>n</i>,<i>d</i>,<i>w</i>), and codes of this size are said to(More)