| 2000 |
|---|
| 22 | EE | John H. Conway,
Charles Radin,
L. Sadun:
Relations in SO (3) Supported by Geodetic Angles.
Discrete & Computational Geometry 23(4): 453-463 (2000) |
| 1999 |
|---|
| 21 | EE | John H. Conway,
Charles Radin,
L. Sadun:
On Angles Whose Squared Trigonometric Functions Are Rational.
Discrete & Computational Geometry 22(3): 321-332 (1999) |
| 1995 |
|---|
| 20 | | John H. Conway,
Neil J. A. Sloane:
What are All the Best Sphere Packings n Low Dimensions?.
Discrete & Computational Geometry 13: 383-403 (1995) |
| 19 | | Neil J. A. Sloane,
R. H. Hardin,
T. D. S. Duff,
John H. Conway:
Minimal-Energy Clusters of Hard Spheres.
Discrete & Computational Geometry 14(3): 237-259 (1995) |
| 1994 |
|---|
| 18 | | John H. Conway,
Neil J. A. Sloane:
Quaternary Constructions for the Binary Single-Error-Correcting Codes of Julin, Best and Others.
Des. Codes Cryptography 4(1): 31-42 (1994) |
| 1993 |
|---|
| 17 | | John H. Conway,
Neil J. A. Sloane:
Self-Dual Codes over the Integers Modulo 4.
J. Comb. Theory, Ser. A 62(1): 30-45 (1993) |
| 1992 |
|---|
| 16 | | John H. Conway,
Neil J. A. Sloane:
On the Covering Multiplicity of Lattices.
Discrete & Computational Geometry 8: 109-130 (1992) |
| 15 | | John H. Conway,
Vera Pless,
Neil J. A. Sloane:
The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration.
J. Comb. Theory, Ser. A 60(2): 183-195 (1992) |
| 1990 |
|---|
| 14 | EE | John H. Conway,
Samuel J. Lomonaco,
N. J. A. Sloane:
A [45, 13] code with minimal distance 16.
Discrete Mathematics 83(2-3): 213-217 (1990) |
| 13 | EE | John H. Conway:
Integral lexicographic codes.
Discrete Mathematics 83(2-3): 219-235 (1990) |
| 12 | | John H. Conway,
Neil J. A. Sloane:
Orbit and coset analysis of the Golay and related codes.
IEEE Transactions on Information Theory 36(5): 1038-1050 (1990) |
| 11 | | John H. Conway,
Neil J. A. Sloane:
A new upper bound on the minimal distance of self-dual codes.
IEEE Transactions on Information Theory 36(6): 1319-1333 (1990) |
| 10 | EE | John H. Conway,
Jeffrey C. Lagarias:
Tiling with polyominoes and combinatorial group theory.
J. Comb. Theory, Ser. A 53(2): 183-208 (1990) |
| 1986 |
|---|
| 9 | | John H. Conway,
Neil J. A. Sloane:
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice.
IEEE Transactions on Information Theory 32(1): 41-50 (1986) |
| 8 | | John H. Conway,
Neil J. A. Sloane:
Lexicographic codes: Error-correcting codes from game theory.
IEEE Transactions on Information Theory 32(3): 337-348 (1986) |
| 1985 |
|---|
| 7 | | John H. Conway,
Neil J. A. Sloane:
A lower bound on the average error of vector quantizers.
IEEE Transactions on Information Theory 31(1): 106- (1985) |
| 1983 |
|---|
| 6 | | John H. Conway,
Vera Pless:
Monomials of orders 7 and 11 cannot be in the group of a (24, 12, 10) self-dual quaternary code.
IEEE Transactions on Information Theory 29(1): 137- (1983) |
| 5 | | John H. Conway,
Neil J. A. Sloane:
A fast encoding method for lattice codes and quantizers.
IEEE Transactions on Information Theory 29(6): 820-824 (1983) |
| 1982 |
|---|
| 4 | EE | John H. Conway,
Vera Pless:
On primes dividing the group order of a doubly-even (72, 36, 16) code and the group order of a quaternary (24, 12, 10) code.
Discrete Mathematics 38(2-3): 157-162 (1982) |
| 3 | | John H. Conway,
Neil J. A. Sloane:
Voronoi regions of lattices, second moments of polytopes, and quantization.
IEEE Transactions on Information Theory 28(2): 211-226 (1982) |
| 2 | | John H. Conway,
Neil J. A. Sloane:
Fast quantizing and decoding and algorithms for lattice quantizers and codes.
IEEE Transactions on Information Theory 28(2): 227-231 (1982) |
| 1980 |
|---|
| 1 | | John H. Conway:
On the Enumeration of Self-Dual Codes.
J. Comb. Theory, Ser. A 28(1): 26-53 (1980) |
