The following pages link to N. J. A. Sloane (Q211649):
Displaying 50 items.
- The optimal isodual lattice quantizer in three dimensions (Q629764) (← links)
- A note on projecting the cubic lattice (Q644824) (← links)
- Double circulant codes over \(\mathbb{Z}_ 4\) and even unimodular lattices (Q679085) (← links)
- A monster Lie algebra? (Q760487) (← links)
- Anti-Hadamard matrices (Q800988) (← links)
- On the integrality of \(n\)th roots of generating functions (Q855873) (← links)
- A [45,13] code with minimal distance 16 (Q917526) (← links)
- The automorphism group of an [18,9,8] quaternary code (Q917527) (← links)
- Generalizations of Schöbi's tetrahedral dissection (Q1017915) (← links)
- A new approach to the covering radius of codes (Q1086543) (← links)
- Four icosahedra can meet at a point (Q1106477) (← links)
- The solution to Berlekamp's switching game (Q1115849) (← links)
- Most primitive groups have messy invariants (Q1132954) (← links)
- The nonexistence of a certain Steiner system S(3,12,112) (Q1158158) (← links)
- Self-dual codes over GF(5) (Q1163524) (← links)
- On the enumeration of lattices of determinant one (Q1170281) (← links)
- The unimodular lattices of dimension up to 23 and the Minkowski-Siegel mass constants (Q1170282) (← links)
- Laminated lattices (Q1172817) (← links)
- Lattices with few distances (Q1176400) (← links)
- The binary self-dual codes of length up to 32: A revised enumeration (Q1193570) (← links)
- On the covering multiplicity of lattices (Q1193702) (← links)
- New spherical 4-designs (Q1199609) (← links)
- Self-dual codes over the integers modulo 4 (Q1208037) (← links)
- Weight enumerators of self-orthogonal codes (Q1211033) (← links)
- The orchard problem (Q1219291) (← links)
- Upper bounds for modular forms, lattices, and codes (Q1219867) (← links)
- Codes over GF(4) and complex lattices (Q1246504) (← links)
- Self-dual codes over GF(4) (Q1254280) (← links)
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions (Q1258520) (← links)
- Penny-packing and two-dimensional codes (Q1262539) (← links)
- A note on optimal unimodular lattices (Q1273720) (← links)
- The shadow theory of modular and unimodular lattices (Q1277191) (← links)
- A group-theoretic framework for the construction of packings in Grassmannian spaces (Q1283451) (← links)
- Orthogonal arrays. Theory and applications (Q1297378) (← links)
- Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others (Q1321554) (← links)
- A new approach to the construction of optimal designs (Q1329698) (← links)
- On lattices equivalent to their duals (Q1335267) (← links)
- Expressing \((a^ 2+b^ 2+c^ 2+d^ 2)^ 3\) as a sum of 23 sixth powers (Q1337182) (← links)
- An on-line version of ``The Encyclopedia of Integer Sequences'' (Q1346732) (← links)
- A linear programming bound for orthogonal arrays with mixed levels (Q1361727) (← links)
- A family of optimal packings in Grassmannian manifolds (Q1383812) (← links)
- On kissing numbers in dimensions 32 to 128 (Q1385028) (← links)
- The lattice of \(N\)-run orthogonal arrays (Q1598712) (← links)
- The number of hierarchical orderings (Q1765961) (← links)
- On non-squashing partitions (Q1781976) (← links)
- Gray codes for reflection groups (Q1825283) (← links)
- What are all the best sphere packings in low dimensions? (Q1892417) (← links)
- Modular and \(p\)-adic cyclic codes (Q1894267) (← links)
- Minimal-energy clusters of hard spheres (Q1900964) (← links)
- The antipode construction for sphere packings (Q1909574) (← links)
