Neil Sloane | Academic Influence

Why Is Neil Sloane Influential?

According to Wikipedia, Neil James Alexander Sloane is a British-American mathematician. His major contributions are in the fields of combinatorics, error-correcting codes, and sphere packing. Sloane is best known for being the creator and maintainer of the On-Line Encyclopedia of Integer Sequences .

Neil Sloane's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

The Theory of Error-Correcting Codes (1977) (7063)
The On-Line Encyclopedia of Integer Sequences (1994) (5539)
Sphere Packings, Lattices and Groups (1988) (3253)
The Z4-linearity of Kerdock, Preparata, Goethals, and related codes (1994) (1333)
Quantum Error Correction Via Codes Over GF(4) (1998) (961)
Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. (1993) (788)
Packing Lines, Planes, etc.: Packings in Grassmannian Spaces (1996) (739)
Pseudo-random sequences and arrays (1976) (713)
The theory of error-correcting codes (north-holland (1977) (697)
The encyclopedia of integer sequences (1995) (634)
Hadamard transform optics (1979) (472)
Fast quantizing and decoding and algorithms for lattice quantizers and codes (1982) (429)
A new table of constant weight codes (1990) (415)
The on-line encyclopedia of integer sequences (2018) (389)
A Handbook Of Integer Sequences (1973) (379)
Codes which detect deception (1974) (372)
A new upper bound on the minimal distance of self-dual codes (1990) (359)
Quantum error correction via codes over GF(4) (1997) (339)
Modular andp-adic cyclic codes (1995) (324)
On Additive Bases and Harmonious Graphs (1980) (311)
Voronoi regions of lattices, second moments of polytopes, and quantization (1982) (308)
Reliable Circuits Using Less Reliable Relays (1993) (289)
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I (1993) (288)
McLaren’s improved snub cube and other new spherical designs in three dimensions (1996) (272)
A fast encoding method for lattice codes and quantizers (1983) (260)
New trellis codes based on lattices and cosets (1987) (255)
An Upper Bound for Self-Dual Codes (1973) (250)
Self-Dual Codes (2002) (239)
Lower bounds for constant weight codes (1980) (238)
On the Classification and Enumeration of Self-Dual Codes (1975) (235)
Multiple-description vector quantization with lattice codebooks: Design and analysis (2001) (232)
Prediction and Entropy of Printed English (1993) (205)
Claude Elwood Shannon: Collected Papers (1993) (198)
On the covering radius of codes (1985) (197)
Channels with Side Information at the Transmitter (1993) (193)
Self-Dual Codes over the Integers Modulo 4 (1993) (190)
New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions (1979) (177)
Quantum Error Correction Via Codes Over GF (1998) (176)
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice (1986) (174)
SPHERE PACKINGS AND ERROR-CORRECTING CODES (1971) (170)
On Single-Deletion-Correcting Codes (2002) (168)
Interleaver design for turbo codes (2001) (158)
A new approach to the construction of optimal designs (1993) (155)
Covering arrays and intersecting codes (1993) (152)
Further results on the covering radius of codes (1986) (149)
Tables of sphere packings and spherical codes (1981) (149)
Self-Dual Codes over GF(4) (1978) (148)
Proof Techniques in Graph Theory (1970) (140)
Lexicographic codes: Error-correcting codes from game theory (1986) (140)
Bounds for binary codes of length less than 25 (1978) (135)
Minimal-energy clusters of hard spheres (1995) (121)
Computability by Probabilistic Machines (1993) (120)
Good self dual codes exist (1972) (117)
New binary codes (1972) (115)
Linear Codes with Covering Radius and Codimension (2001) (113)
The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration (1992) (113)
Masks for Hadamard transform optics, and weighing designs. (1976) (110)
Self-dual codes over GF(3) and GF(4) of length not exceeding 16 (1979) (109)
Generalizations of Gleason's theorem on weight enumerators of self-dual codes (1972) (108)
Some doubly exponential sequences (1973) (108)
The Invariants of the Clifford Groups (2001) (108)
The Packing of Spheres (1984) (107)
The Zero Error Capacity of a Noisy Channel (1993) (105)
A linear construction for certain Kerdock and Preparata codes (1993) (105)
Magic numbers in polygonal and polyhedral clusters (1985) (99)
Codes for multiplex spectrometry. (1969) (97)
Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique (1977) (92)
Some canonical sequences of integers (1995) (90)
A nonadditive quantum code (1997) (89)
The Shadow Theory of Modular and Unimodular Lattices (1998) (87)
The Optimal Lattice Quantizer in Three Dimensions (1983) (87)
Uniqueness of Certain Spherical Codes (1981) (87)
On the Existence of a Projective Plane of Order 10 (1973) (86)
A lower bound on the average error of vector quantizers (1985) (86)
Upper bounds for modular forms, lattices, and codes (1975) (85)
A Group-Theoretic Framework for the Construction of Packings in Grassmannian Spaces (1999) (84)
Tables of Orthogonal Arrays (1999) (79)
On the Voronoi Regions of Certain Lattices (1984) (77)
Asymmetric multiple description lattice vector quantizers (2002) (77)
TWO-GRAPHS, SWITCHING CLASSES AND EULER GRAPHS ARE EQUAL IN NUMBER* (1975) (76)
Multiple description lattice vector quantization (1999) (73)
Low–dimensional lattices. VII. Coordination sequences (1997) (72)
Bounds on Mixed Binary/Ternary Codes (1998) (72)
Kepler's conjecture confirmed (1998) (69)
Four-dimensional modulation with an eight-state trellis code (1985) (69)
Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices (1992) (69)
Is there a (72, 36) d = 16 self-dual code? (Corresp.) (1973) (68)
The Nordstrom-Robinson Code is the Binary Image of 19 the Octacode (1992) (68)
Self-Dual Codes over GF(5) (1982) (67)
Self-Dual Codes over ${\text{GF}}( 3 )$ (1976) (67)
The Cell Structures of Certain Lattices (1991) (65)
A Universal Turing Machine with Two Internal States (1993) (65)
On the Existence of Similar Sublattices (1999) (62)
A Highly Symmetric Four-Dimensional Quasicrystal * (1987) (61)
NEW LATTICE PACKINGS OF SPHERES (1983) (59)
The orchard problem (1974) (59)
Encrypting by Random Rotations (1982) (59)
Four-dimensional lattices with the same theta series (1992) (59)
On the enumeration of lattices of determinant one (1982) (58)
Low-dimensional lattices. IV. The mass formula (1988) (58)
An On-Line Version of the Encyclopedia of Integer Sequences (1994) (57)
Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20 (1980) (57)
New family of single-error correcting codes (1970) (57)
Penny-packing and two-dimensional codes (1990) (56)
Low-dimensional lattices. I. Quadratic forms of small determinant (1988) (54)
Self-Dual Codes and Invariant Theory (Algorithms and Computation in Mathematics) (2006) (53)
What are all the best sphere packings in low dimensions? (1995) (51)
Cyclic self-dual codes (1983) (51)
On Lattices Equivalent To Their Duals (1994) (50)
Shift-Register Synthesis (Modulo m) (1985) (49)
Claude E. Shannon (1993) (47)
Self-dual codes and lattices (1979) (46)
The Coxeter–Todd lattice, the Mitchell group, and related sphere packings (1983) (46)
Acyclic Digraphs and Eigenvalues of O,1 Matrices (2003) (46)
Techniques of Bounding the Probability of Decoding Error for Block Coded Modulation Structures (1994) (45)
On ternary self-dual codes of length 24 (1981) (44)
Algebraic Description of Coordination Sequences and Exact TopologicalDensities for Zeolites (1996) (43)
An eight-dimensional trellis code (1986) (43)
Weight enumerator for second-order Reed-Muller codes (1970) (43)
Unsolved Problems in Graph Theory Arising from the Study of Codes (1989) (42)
Low-dimensional lattices. III. Perfect forms (1988) (40)
An Introduction to Association Schemes and Coding Theory (1975) (39)
Doubly multiplexed dispersive spectrometers. (1970) (39)
A Family of Optimal Packings in Grassmannian Manifolds (1998) (39)
Updated tables of parameters of (T, M, S)‐nets (1999) (38)
Shift-Register Synthesis (Modula m) (1983) (38)
An improvement to the Minkowski-Hiawka bound for packing superballs (1987) (37)
Theta series and magic numbers for close‐packed spherical clusters (1985) (36)
Gray codes for reflection groups (1989) (36)
The Covering Radius of the Leech Lattice (1993) (36)
Design of asymmetric multiple description lattice vector quantizers (2000) (36)
Sphere Packing and Error-Correcting Codes (1999) (36)
On sublattices of the hexagonal lattice (1997) (36)
Gleason's theorem on self-dual codes (1972) (35)
My Favorite Integer Sequences (1998) (35)
The Sphere-Packing Problem (1998) (35)
Assessment of the National Bureau of Standards Proposed Federal Data Encryption Standard (1977) (34)
A New Operation on Sequences: The Boustrophedon Transform (1996) (34)
A linear programming bound for orthogonal arrays with mixed levels (1996) (32)
Errors in Hadamard spectroscopy or imaging caused by imperfect masks. (1975) (31)
A Note on Optimal Unimodular Lattices (1998) (30)
Low-dimensional lattices. II. Subgroups of GL(n, ℤ) (1988) (29)
The enumeration of rooted trees by total height (1969) (29)
The MacWilliams identities for nonlinear codes (1972) (29)
The solution to Berlekamp's switching game (1989) (28)
Double Circulant Codes over $$\mathbb{Z}_4 $$ and Even Unimodular Lattices (1997) (28)
Twenty-Three Constructions for the Leech Lattice (1988) (28)
Anti-Hadamard matrices (1984) (28)
The Synthesis of TwoTerminal Switching Circuits (1993) (27)
A new approach to the covering radius of codes (1986) (27)
A survey of constructive coding theory, and a table of binary codes of highest known rate (1972) (26)
Atomic arrangements and electronic requirements for close-packed circular and spherical clusters (1986) (26)
Low-dimensional lattices V. Integral coordinates for integral lattices (1989) (25)
On pseudo-random arrays (1979) (25)
A strengthening of the Assmus-Mattson theorem (1991) (25)
Orbit and coset analysis of the Golay and related codes (1990) (25)
New spherical 4-designs (1992) (25)
Memory Requirements in a Telephone Exchange (1993) (25)
On non-squashing partitions (2005) (24)
Magic Numbers in Polygonal and Polyhedral Clusters. (1986) (24)
New sphere packings in dimensions 9–15 (1970) (24)
The Unimodular Lattices of Dimension up to 23 and the Minkowski-Siegel Mass Constants (1982) (23)
Extremal self-dual lattices exist only in dimensions 1 to 8 (1978) (22)
Scientific Aspects of Juggling (1993) (22)
The covering radius of cyclic codes of length up to 31 (1985) (22)
Quantizing Using Lattice Intersections (2002) (22)
Multiplexing Methods in Spectroscopy (1979) (22)
Lorentzian forms for the Leech lattice (1982) (21)
A LATTICE WITHOUT A BASIS OF MINIMAL VECTORS (1995) (21)
A new upper bound for the minimum of an integral lattice of determinant 1 (1990) (21)
Inequalities for covering codes (1988) (21)
Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others (1994) (21)
On the covering radius problem for codes II. codes of low dimension; normal and abnormal codes (1987) (20)
FURTHER LATTICE PACKINGS IN HIGH DIMENSIONS (1982) (19)
On the invariants of a linear group of order 336 (1973) (19)
Nonintersecting subspaces based on finite alphabets (2005) (19)
A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES (1970) (18)
Complex and integral laminated lattices (1983) (18)
On asymmetric coverings and covering numbers (2002) (18)
OPERATING MANUAL FOR GOSSET: A GENERAL- PURPOSE PROGRAM FOR CONSTRUCTING EXPERIMENTAL DESIGNS (SECOND EDITION). (1994) (18)
On Cayley's Enumeration of Alkanes (or 4-Valent Trees) (1999) (18)
Packing Planes in Four Dimensions and Other Mysteries (2002) (18)
A Simple Construction for the Barnes-Wall Lattices (2002) (18)
Binary self-dual codes of length 24 (1974) (17)
Codes over GF(4) and complex lattices (1978) (17)
Double Circulant Codes over Z 4 and Even Unimodular Lattices (1997) (17)
Some Geometrical Results in Channel CapacityNachrichtentechnische Zeit, vol. 10. 1957. (1993) (16)
A Mathematical Theory of Communication (1993) (16)
Complete weight enumerators of generalized doubly-even self-dual codes (2004) (16)
Spherical designs in four dimensions (2003) (16)
Theta series and magic numbers for diamond and certain ionic crystal structures (1987) (16)
New permutation codes using Hadamard unscrambling (1987) (16)
A Short Course on Error Correcting Codes (1975) (15)
Interleaver design for short block length turbo codes (2000) (15)
Obituary: Claude Shannon (1916–2001) (2001) (15)
On the covering radius problem for codes I. bounds on normalized covering radius (1987) (15)
Most primitive groups have messy invariants (1979) (15)
Weight enumerators of self-orthogonal codes (1974) (15)
Probability of Error for Optimal Codes in a Gaussian Channel (1993) (15)
Weight Enumerators of Codes (1975) (15)
A Monster Lie Algebra (1984) (14)
Statistical Application of Orthogonal Arrays (1999) (14)
A Coding Algorithm for Constant Weight Vectors: A Geometric Approach Based on Dissections (2009) (14)
On the integrality of nth roots of generating functions (2006) (14)
Hadamard and Other Discrete Transforms in Spectroscopy (1982) (13)
Error-Correcting Codes and Cryptography (1981) (13)
Unsolved Problems Related to the Covering Radius of Codes (1987) (13)
Codes and Invariant Theory (2003) (13)
Restrictions on Weight Distribution of Reed-Muller Codes (1969) (13)
Expressing (a2 + b2 + c2 + d2)3 as a Sum of 23 Sixth Powers (1994) (12)
Twenty-three constructions for the Leech lattice (1982) (12)
Systematic errors in Hadamard transform optics. (1978) (12)
On finding the paths through a network (1972) (12)
Recent Progress in Sphere Packing (1999) (12)
Sphere packings constructed from BCH and Justesen codes (1972) (12)
A Note on Projecting the Cubic Lattice (2011) (11)
On Kissing Numbers in Dimensions 32 to 128 (1998) (11)
Computer-Generated Minimal ( and Larger ) Response-Surface Designs : ( I ) The Sphere (1991) (11)
Computer-Generated Minimal (and Larger) Response-Surface Designs: (II) The Cube (1991) (11)
APPLICATIONS OF FINITE FROBENIUS RINGS TO THE FOUNDATIONS OF ALGEBRAIC CODING THEORY (2011) (10)
Codes from Symmetry Groups, and a [32, 17, 8] Code (1989) (10)
A [45, 13] code with minimal distance 16 (1990) (10)
On the Apparent Duality of the Kerdock and Preparata Codes (1993) (10)
On the Classification of Integral Quadratic Forms (1999) (10)
New Spherical 4-designs (1993) (9)
The automorphism group of an [18, 9, 8] quaternary code (1990) (9)
2178 And All That (2013) (9)
The Number of Hierarchical Orderings (2004) (9)
Lattices with Few Distances (1991) (9)
The antipode construction for sphere packings (1996) (9)
The lifting construction: A general solution for the fat strut problem (2010) (9)
Communication Theory of Secrecy SystemsThe material in this paper appeared originally in a confidential report Â¿A Mathematical Theory of CryptographyÂ¿ dated Sept. 1, 1945, which has now been declassified. (1993) (8)
The Toothpick Sequence and Other Sequences from Cellular Automata (2010) (8)
Monotonicity Properties for the Stochastic Knapsack (1990) (8)
Coverings, Lattices and Quantizers (1988) (8)
Dynamical systems, curves and coding for continuous alphabet sources (2002) (8)
On Curling Numbers of Integer Sequences (2012) (8)
The ternary Golay code, the integers mod 9, and the Coxeter-Todd lattice (1996) (7)
Sphere Packings and Kissing Numbers (1993) (7)
Approximate Squaring (2004) (7)
A coloring-book approach to finding coordination sequences. (2019) (7)
On Blind Identifiability of Multipath Channels Using Fractional Sampling and Second-Order Cyclostationary Statistics (1995) (7)
On a conjecture concerning coverings of Hamming space (1984) (7)
Generalizations of Schöbi’s Tetrahedral Dissection (2009) (7)
On a problem of Ryskov concerning lattice coverings (1982) (7)
On the Number of ON Cells in Cellular Automata (2015) (7)
Bounds on Kissing Numbers (1993) (7)
The lattice of N-run orthogonal arrays (2002) (7)
Hamiltonian cycles in a graph of degree 4 (1969) (7)
The Nonexistence of a Certain Steiner System (1981) (7)
Weight Enumerators of Self-Orthogonal Codes over $GF$(3) (1981) (6)
The EKG Sequence (2002) (6)
Representation Theory, Group Rings, and Coding Theory (1989) (6)
Some Topics in Information Theory (1993) (6)
Optimal Interleaver Design for Short Block-length Turbo Codes (2007) (6)
A simple description of an error-correcting code for high-density magnetic tape (1976) (6)
Interleaver design for turbo codes (2000) (6)
Leech Roots and Vinberg Groups (1993) (6)
Realization of All 16 Switching Functions of Two Variables Requires 18 ContactsBell Laboratories Memorandum, Nov. 17, 1953. (1993) (6)
On the covering multiplicity of lattices (1992) (5)
Certain Important Lattices and Their Properties (1988) (5)
A Note on the Leech Lattice as a Code for the Gaussian Channel (1980) (5)
On Constant Weight Codes and Harmonious Graphs. (1979) (5)
Algebraic Coding Theory : Recent Developments Related to the Integers Mod 4 (1995) (5)
The Curling Number Conjecture (2009) (5)
Recent Developments in Communication Theory (1993) (5)
An Introduction to Optical Multiplexing Techniques (1979) (5)
On expections of integral quadratic forms. (1981) (5)
A Symmetrical Notation for Numbers (1993) (4)
A Simplified Derivation of Linear Least Square Smoothing and Prediction TheoryDecimal classification: 510. Original manuscript received by the Institute. July 13,1949; revised manuscript received. January 17, 1950. (1993) (4)
What are the Latin Square Groups (1973) (4)
The Gift Exchange Problem (2009) (4)
Gleason's Theorem on Self-Dual Codes and Its Generalizations (2006) (4)
The optimal isodual lattice quantizer in three dimensions (2007) (4)
The Primary Pretenders (1997) (4)
Eight hateful sequences (2008) (4)
Error-Correcting Codes and Cryptography Part I (1982) (4)
Constant Weight Codes: A Geometric Approach Based on Dissections (2007) (4)
Dismal Arithmetic (2011) (4)
Seven Staggering Sequences (2009) (4)
Coset Analysis of Reed Muller Codes Via Translates of Finite Vector Spaces (1972) (4)
The antipode construction for sphere packings (1996) (4)
Four icosahedra can meet at a point (1988) (3)
LENGTHS OF CYCLE TIMES IN RANDOM NEURAL NETWORKS (1967) (3)
Voronoi Cells of Lattices and Quantization Errors (1988) (3)
Codes and lattices (1998) (3)
Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces (1997) (3)
The Best Detection of PulsesBell Laboratories Memorandum, June 22, 1944. (1993) (3)
The Basic Theory of Hadamard Transform Spectrometers and Imagers (1979) (3)
Analysis of the Gift Exchange Problem (2017) (3)
Dissections and Constant Weight Codes (2006) (3)
Fat struts: Constructions and a bound (2009) (3)
Analogue of the Vernam System for Continuous Time SeriesBell Laboratories Memorandum, May 10, 1943. (1993) (3)
Numerical analogues of Aronson's sequence. (2003) (3)
Letter to Vannevar Bush, February 16, 1939 (1993) (3)
Nonintersecting subspaces based on finite alphabets (2004) (3)
A Slow-Growing Sequence Defined by an Unusual Recurrence (2006) (3)
Queens in Exile: Non-attacking Queens on Infinite Chess Boards (2020) (3)
New spherical designs in three and four dimensions (1995) (2)
DESCRIPTION OF THE BOOK (1973) (2)
A Zador-like formula for quantizers based on periodic tilings (2002) (2)
A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata (2015) (2)
Odd-Rule Cellular Automata on the Square Grid (2015) (2)
The Golay Code (1975) (2)
Asymptotic performance of multiple description lattice quantizers (2000) (2)
Last update: April 3rd, 2014 ERRATUM AND COMPLEMENTS TO MONOGRAPHIE 37 RÉSEAUX EUCLIDIENS, DESIGNS SPHÉRIQUES ET FORMES MODULAIRES (2014) (2)
Automated Proof (or Disproof) of Linear Recurrences Satisfied by Pisot Sequences (2016) (2)
Construction of Orthogonal Arrays from Codes (1999) (2)
Mixed Orthogonal Arrays (1999) (2)
Reducing the Number of Measurements in Doubly Multiplexed Spectrometers (1971) (2)
Carryless Arithmetic Mod 10 (2010) (2)
Orthogonal Arrays and Galois Fields (1999) (2)
Elementary Problems: E2701-E2706 (1978) (2)
The On-Line Encyclopedia of Integer Sequences: From Punched Cards to Wiki in 46 Years (abstract; invited talk) (2011) (2)
The covering radius of the Leech lattice (1982) (2)
Orthogonal Arrays and Error-Correcting Codes (1999) (2)
Noise or When to Multiplex and When to Avoid It (1979) (1)
More on the Minimum Distance of Cyclic Codes (1)
Efficient Coding of a Binary Source with One Very Infrequent SymbolBell Laboratories Memorandum, Jan. 29, 1954. (1993) (1)
Claude Shannon's Nodrop Juggling Diorama (1993) (1)
Real and Complex Clifford Groups (2006) (1)
A Relay Laboratory Outfit for CollegesBell Laboratories Memorandum, Jan. 10, 1954. (1993) (1)
A MindReading (?) MachineBell Laboratories Memorandum, March 18, 1953. (1993) (1)
ILLUSTRATED DESCRIPTION OF SOME IMPORTANT SEQUENCES (1973) (1)
Algebraic Constructions for Lattices (1993) (1)
An upper bound for self-dual codes (Corresp.) (1975) (1)
Codes, Designs and Groups (1988) (1)
The Simultaneous Synthesis of s Switching Functions of n VariablesBell Laboratories Memorandum, June 8, 1955. (1993) (1)
Applications of error-correcting codes to orthogonal arrays and the design of experiments (1994) (1)
A Theorem on Coloring the Lines of a Network (1993) (1)
Descending Dungeons and Iterated Base-Changing (2009) (1)
The Optimal Lattice Quantizer in Three Dimensions 1 (1983) (1)
Three Cousins of Recamán's Sequence (2020) (1)
Communication Theory Information Theory Cryptography (1993) (1)
Information TheoryReprinted with permission from Encyclopaedia Brittanica, 14th edition, 1968 by Encyclopaedia Britannica, Inc. (1993) (1)
Communication Theory Exposition of FundamentalsIRE Transactions Information Theory, No. 1, Feb. 1950. (1993) (1)
A Note on Modular Partitions and Necklaces (2014) (1)
The detection of long error bursts during transmission of video signals (1982) (1)
Comments on "On the covering radius of codes" [with reply] (1990) (1)
Von Neumann's Contributions to Automata TheoryBulletin American Mathematical Society, volume 64, 1958. (1993) (1)
The Weight Distribution of Cosets (1994) (1)
Orthogonal Arrays and Difference Schemes (1999) (1)
C O ] 2 0 Ju l 2 00 2 On the Existence of Similar Sublattices (1999) (1)
New Family of Single-Error (1970) (1)
Atomic Arrangements and Electronic Requirements for Close‐Packed Circular and Spherical Clusters (1986) (1)
Constant weight codes: a geometric approach (2005) (1)
NEW SPHERE PACKINGS IN DIMENSIONS 9-15 BY JOHN LEECH AND N. J. A. SLOANE (1970) (1)
Throbac IBell Laboratories Memorandum, April 9, 1953. (1993) (0)
A Study of the Deflection Mechanism and Some Results on Rate FindersReport to National Defense Research Committee, circa April 1941. (1993) (0)
The Relay Circuit AnalyzerBell Laboratories Memorandum, March 31, 1953. (1993) (0)
"Choix de Bruxelles": A New Operation on Positive Integers (2019) (0)
Further Constructions and Related Structures (1999) (0)
A Note on Zador ’ s Formula (2007) (0)
The Number of TwoTerminal SeriesParallel Networks (1993) (0)
Review of 'Secure Communications and Asymmetric Cryptosystems' (Simmons, G.J., Ed.; 1982) (1984) (0)
Enumeration of Extremal Self-Dual Lattices (1988) (0)
Game Playing MachinesDelivered at the 1955 Medal Day Meeting, October 19, 1955, in acceptance of the Stuart Ballantine Medal. (1993) (0)
Review of 'Projective Geometries over Finite Fields' (Hirschfeld, J. W. P.; 1979) (1981) (0)
Finding the Closest Lattice Point (1993) (0)
The BandwagonIEEE Transactions Information Theory, volume 2, March 1956. (1993) (0)
Maximal Isotropic Codes and Lattices (2006) (0)
The Lattice Theory of InformationIRE Transactions Information Theory, No. 1, Feb. 1950. (1993) (0)
Presentation of a MazeSolving MachineTransactions 8th Cybernetics Conference, Josiah Macy Jr. Foundation, 1952. (1993) (0)
Orthogonal Arrays and Hadamard Matrices (1999) (0)
Fat Struts : Constructions and an Achievable Bound (2009) (0)
Arrays and Intersecting Codes (1993) (0)
Asymmetric Multiple Description Lattice (2000) (0)
Review of 'New Concepts in Multi-User Communication' (Skwirzynski, J.K., Ed.; 1982) (1983) (0)
Concavity of Transmission Rate as a Function of Input ProbabilitiesBell Laboratories Memorandum, June 8, 1955. (1993) (0)
On the Intractability of Permuting a Block Code to Minimize Trellis (2004) (0)
SHIFF-REGISTER SYNTHESIS (MODULO in)* (1985) (0)
The Category Quad (2006) (0)
Plane packing (2001) (0)
Eecient Regression Veriication (1996) (0)
TwoWay Communication Channels (1993) (0)
On Error-correcting Balanced Codes, Ieee on Codes Satisfying Mth Order Running Digital Binary Transmission Codes with Higher Order Spec- Matched Spectral-null Codes for Partial-response Chan (0)
Programming a computer for playing chessFirst presented at, the National IRE Convention, March 9, 1949, New York, U.S.A. (1993) (0)
Integer sequences, online encyclopedia of (2003) (0)
a New Multiplexing Spectrometer with Large Throughput (1971) (0)
Fractional Factorial Plans@@@Orthogonal Arrays: Theory and Applications (2000) (0)
Chapter 7 – Applications (1979) (0)
to the Distance Distribution of Codes (1995) (0)
Review of Â¿Cybernetics, or Control and Communication in the Animal and the Machine,Â¿ by Norbert WienerProceedings Institute of Radio Engineers, volume 37, 1949. (1993) (0)
George Pólya Awards for 2013 (2014) (0)
Classical Self-Dual Codes (2006) (0)
Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids (2020) (0)
Review of Â¿Description of a Relay Calculator,Â¿ by the Staff of the [Harvard] Computation LaboratoryProceedings Institute of Radio Engineers, volume 38, 1950. (1993) (0)
The Philosophy of PCMDecimal classification: R148.6. Original manuscript received by the Institute, May 24, 1948. (1993) (0)
The Theorems of MacWilliams and Gleason (1975) (0)
Enumeration of Self-Dual Codes (2006) (0)
Enumeration of Unimodular Lattices (1993) (0)
The Use of the LakatosHickman Relay in a Subscriber SenderBell Laboratories Memorandum, August 13, 1940. (1993) (0)
Weight Enumerators and Important Types (2006) (0)
ERROR CORRECTING CODES MT361/MT461/MT5461 (2012) (0)
N ov 2 00 6 Descending Dungeons and Iterated Base-Changing (2006) (0)
More on fisheries (2003) (0)
An Algebra for Theoretical Genetics Ph.D. Dissertation, Massachusetts Institute of Technology, 1940. (1993) (0)
three-dimensional lattices (2016) (0)
Further Connections Between Codes and Lattices (1993) (0)
A Recording of a Transparent Light Bulb. See Figure 7. a Recording of a Chess Set. See Figure 5. References (0)
The Transient Behavior of a Large Number of FourTerminal Unilateral Linear Networks Connected in TandemBell Laboratories Memorandum, April 10, 1946. (1993) (0)
Martin Gardner in the Twenty-First Century: Carryless Arithmetic Mod 10 (2012) (0)
The EKG Sequence: 10927 (2004) (0)
Linear combinations of inaccurate measurements yield improved results from minimal laboratory data. (2016) (0)
Sloping Binary Numbers: A New Sequence Related to the Binary Numbers (2005) (0)
C O ] 2 8 M ay 2 00 2 On Asymmetric Coverings and Covering Numbers (2013) (0)
The Potentialities of ComputersBell Laboratories Memorandum, April 3, 1953. (1993) (0)
The Type of a Self-Dual Code (2006) (0)
Machine Aid for Switching Circuit DesignDecimal classification: 621.375.2R257. Original manuscript received by the Institute, May 28, 1953; revised manuscript received June 29, 1953. (1993) (0)
On Junction Numbers (2014) (0)
A Survey of Multiplexing Spectrometers (1979) (0)
Some Results on Ideal Rectifier CircuitsBell Laboratories Memorandum, June 8, 1955. (1993) (0)
Computing Science A Question of Numbers (1997) (0)
TheNordstrom-RobinsonCodeistheBinaryImage oftheOctacode (1993) (0)
Review of Â¿Transformations on Lattices and Structures of Logic,Â¿ by Stephen A. KissProceedings Institute of Radio Engineers, volume 37, 1949. (1993) (0)
Extremal and Optimal Codes (2006) (0)
Complete Classification of (24,12) and (22,11) Self-Dual Codes (1974) (0)
N T ] 1 4 Fe b 20 07 Descending Dungeons and Iterated Base-Changing (2006) (0)
A Note on the Maximum Flow Through a NetworkManuscript received by the PGIT, July 11, 1956. (1993) (0)
Some Experimental Results on the Deflection MechanismReport to National Defense Research Committee, June 8, 1941 (1993) (0)
Computers and AutomataDecimal classification: 621.385.2. Original manuscript received by the Institute, July 17, 1953. (1993) (0)
METHOD TIME ENDEPENDENT OF MESSAGE LENGTH (2017) (0)
The Main Theorems (2006) (0)
3 2 J ul 1 99 6 Quantum Error Correction and Orthogonal Geometry (2008) (0)
Computers Circuits Games (1993) (0)
The Relay Circuit SynthesizerBell Laboratories Memorandum, Nov. 30, 1953. (1993) (0)
Bounds for Codes and Sphere Packings (1993) (0)
Mathematical Theory of the Differential Analyzer (1993) (0)
Computers and AutomationProgress and Promise in the Twentieth Century (1993) (0)
The Theory and Design of Linear Differential Equation MachinesReport to National Defense Research Council, January, 1942. (1993) (0)
Review of 'Projective Geometries over Finite Fields' (J. W. P. Hirschfeld, 1979). (1981) (0)
Further Examples of Self-Dual Codes (2006) (0)
Leech roots and Vinberg groups (1982) (0)
Network RingsBell Laboratories Memorandum, June 11, 1948. (1993) (0)
Correction to "The ternary golay code, the integers 9 and the Coxeter-Todd lattice" (2003) (0)
Communicated by the Managing Editors (1972) (0)
Discussion of Preceding Three PapersIRE Transactions Information Theory, No. 1, Feb. 1950. (1993) (0)
The Rate of Approach to Ideal CodingProceedings Institute of Radio Engineers, volume 43, 1955. (1993) (0)
2 0 Ju l 2 00 2 My Favorite Integer Sequences (2008) (0)
Papers in honor of F. Jessie MacWilliams (1983) (0)
Notes to Part B (1993) (0)
Rao’s Inequalities and Improvements (1999) (0)
Review of 'Advances in Computer System Security' (Turn, R.; 1981) (1982) (0)
Spherical Designs in Four Dimensions ( Extended Abstract ) (0)
Orthogonal Arrays and Latin Squares (1999) (0)
The Yellowstone Permutation (2015) (0)
Integer Sequences Related to Chemistry (0)
M ay 2 00 2 The Lattice of N-Run Orthogonal Arrays (0)
Circuits for a P.C.M. Transmitter and ReceiverBell Laboratories Memorandum, June 1, 1944. (1993) (0)
Concavity of Resistance Functions (1993) (0)
Backlash in Overdamped SystemsReport to National Defense Research Committee, June 26, 1941. (1993) (0)
Designing an Auditing Procedure, or How to Keep Bank Managers on Their Toes (1984) (0)
General Treatment of the Problem of CodingIRE Transactions Information Theory, No. 1, Feb. 1950. (1993) (0)
On squares, cubes, ... in Z[[x]]* (2005) (0)
A Note on a Partial Ordering for Communication Channels (1993) (0)
Errata: Low-Dimensional Lattices. III. Perfect Forms (1989) (0)
A ChessPlaying Machine (1993) (0)
The Weight Distribution of the Third-Order Reed-Muller Code of Length 512 (1996) (0)
Error-Correcting Codes and Cryptography Part II (1982) (0)
QuaternaryConstructionsfortheBinarySingle-Error-CorrectingCodes ofJulin,BestandOthers (1994) (0)
HOW TO HANDLE A STRANGE SEQUENCE (1973) (0)
A Method of Power or Signal Transmission to a Moving VehicleBell Laboratories Memorandum, July 19, 1950. (1993) (0)
Carryless Arithmetic (I): The Mod 10 Version (2010) (0)
On Kaprekar's Junction Numbers (2016) (0)
Internal Accession Date Only (1999) (0)

This paper list is powered by the following services:

Other Resources About Neil Sloane

What Schools Are Affiliated With Neil Sloane?

Neil Sloane is affiliated with the following schools:

Neil Sloane's AcademicInfluence.com Rankings

Image Attributions

Image Source for Neil Sloane