#### Filter Results:

#### Publication Year

1975

2012

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We all recognize 0 If you come across a number sequence and want to know if it has been studied before, there is only one place to look, the On-Line Encyclopedia of Integer Sequences (or OEIS). Now in its 48th year, the OEIS contains over 200,000 sequences and 15,000 new entries are added each year. This article will briefly describe the OEIS and its… (More)

This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are described, as well as a reformulation of the problem that was suggested by these computations. The reformulation gives a way to… (More)

The problem of finding quantum-error-correcting codes is transformed into the problem of finding additive codes over the field GF (4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.

For each of the lattices A, and their duals a very fast algorithm is given for finding the closest lattice point to an arbitrary point. If these lattices are used for vector quantizing of uniformly distributed data, the algorithm finds the minimum distortion lattice point. If the lattices are used as codes for a Gaussian channel, the algorithm performs… (More)

The problem of designing a multiple description vector quantizer with lattice codebook Λ is considered. A general solution is given to a labeling problem which plays a crucial role in the design of such quantizers. Numerical performance results are obtained for quantizers based on the lattices A 2 and i , i = 1, 2, 4, 8, that make use of this labeling… (More)

A table of binary constant weight codes of length n <; 28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are surveyed, and also a table is given of (unrestricted) binary codes of length J1 <; 28. T HE MAIN GOAL of this… (More)

The covering radius R of a code is the maximal distance of any vector from the code. This work gives a number of new results concerning t[ n, k], the minimal covering radius of any binary code of length n and dimension k. For example r[ n, 41 and t [ n, 51 are determined exactly, and reasonably tight bounds on t[ n, k] are obtained for any k when n is… (More)

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals. It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over Z 4 , the integers mod 4… (More)

We consider the problem of designing a lattice-based multiple description vector quantizer for a two-channel diversity system. The design of such a quan-tizer can be reduced to the problem of assigning pair labels to points of a vector quantizer codebook. A general labeling procedure based on the structure of the lattice is presented, along with detailed… (More)