default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil J. A. Sloane
- > Home > Persons > Neil J. A. Sloane
Publications
- 2017
[j106]Moa Apagodu, David L. Applegate, Neil J. A. Sloane, Doron Zeilberger:
Analysis of the Gift Exchange Problem. Electron. J. Comb. 24(3): 3 (2017)- 2015
- [j105]David L. Applegate, Hans Havermann, Robert G. Selcoe, Vladimir Shevelev, Neil J. A. Sloane, Reinhard Zumkeller:
The Yellowstone Permutation. J. Integer Seq. 18(6): 15.6.7 (2015) - 2012
- [i2]Benjamin Chaffin, John P. Linderman, Neil J. A. Sloane, Allan R. Wilks:
On Curling Numbers of Integer Sequences. CoRR abs/1212.6102 (2012) - 2011
- [j104]Neil J. A. Sloane, Vinay A. Vaishampayan
, Sueli I. Rodrigues Costa:
A Note on Projecting the Cubic Lattice. Discret. Comput. Geom. 46(3): 472-478 (2011) - 2010
- [c16]Neil J. A. Sloane, Vinay A. Vaishampayan, Sueli I. Rodrigues Costa:
The lifting construction: A general solution for the fat strut problem. ISIT 2010: 1037-1041 - 2009
- [j103]Neil J. A. Sloane, Vinay A. Vaishampayan:
Generalizations of Schöbi's Tetrahedral Dissection. Discret. Comput. Geom. 41(2): 232-248 (2009) - [j102]Chao Tian, Vinay A. Vaishampayan, Neil J. A. Sloane:
A Coding Algorithm for Constant Weight Vectors: A Geometric Approach Based on Dissections. IEEE Trans. Inf. Theory 55(3): 1051-1060 (2009) - [p1]David L. Applegate, Marc LeBrun, Neil J. A. Sloane:
Descending Dungeons and Iterated Base-Changing. The Mathematics of Preference, Choice and Order 2009: 393-402 - 2007
- [j101]John H. Conway, Neil J. A. Sloane:
The optimal isodual lattice quantizer in three dimensions. Adv. Math. Commun. 1(2): 257-260 (2007) - [j100]Marc LeBrun, David L. Applegate, Neil J. A. Sloane:
Problem 11286. Am. Math. Mon. 114(4): 358 (2007) - 2006
- [j99]Nadia Heninger, Eric M. Rains, Neil J. A. Sloane:
On the integrality of nth roots of generating functions. J. Comb. Theory A 113(8): 1732-1745 (2006) - 2005
- [j97]Frédérique E. Oggier, Neil J. A. Sloane, Suhas N. Diggavi, A. Robert Calderbank:
Nonintersecting subspaces based on finite alphabets. IEEE Trans. Inf. Theory 51(12): 4320-4325 (2005) - [c14]Chao Tian, Vinay A. Vaishampayan, Neil J. A. Sloane:
Constant weight codes: a geometric approach. ISIT 2005: 249-253 - 2004
- [j96]Jeffrey C. Lagarias, Neil J. A. Sloane:
Approximate Squaring. Exp. Math. 13(1): 113-128 (2004) - [j95]Gabriele Nebe, Heinz Georg Quebbemann, Eric M. Rains, Neil J. A. Sloane:
Complete weight enumerators of generalized doubly-even self-dual codes. Finite Fields Their Appl. 10(4): 540-550 (2004) - [j93]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane, Nasha Komanda:
The EKG Sequence: 10927. Am. Math. Mon. 111(2): 167-168 (2004) - [c13]Frédérique E. Oggier, Neil J. A. Sloane, Suhas N. Diggavi, A. Robert Calderbank:
Nonintersecting subspaces based on finite alphabets. ISIT 2004: 455 - 2003
- [j92]A. Robert Calderbank, Neil J. A. Sloane:
Correction to "The ternary golay code, the integers 9 and the Coxeter-Todd lattice". IEEE Trans. Inf. Theory 49(1): 347 (2003) - [c12]Neil J. A. Sloane, Ronald H. Hardin, Philippe Cara:
Spherical designs in four dimensions. ITW 2003: 253-258 - 2002
- [j91]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane:
The EKG Sequence. Exp. Math. 11(3): 437-446 (2002) - [j90]Jeffrey C. Lagarias, Eric M. Rains, Neil J. A. Sloane:
Problem 10927. Am. Math. Mon. 109(2): 202 (2002) - [j89]Suhas N. Diggavi, Neil J. A. Sloane, Vinay A. Vaishampayan:
Asymmetric multiple description lattice vector quantizers. IEEE Trans. Inf. Theory 48(1): 174-191 (2002) - [j88]Neil J. A. Sloane, Vinay A. Vaishampayan:
A Zador-like formula for quantizers based on periodic tilings. IEEE Trans. Inf. Theory 48(12): 3138-3140 (2002) - [c11]Vinay A. Vaishampayan, Neil J. A. Sloane, Sueli I. R. Costa:
Dynamical systems, curves and coding for continuous alphabet sources. ITW 2002: 111-114 - 2001
- [j87]Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane:
The Invariants of the Clifford Groups. Des. Codes Cryptogr. 24(1): 99-122 (2001) - [j86]Hamid R. Sadjadpour, Neil J. A. Sloane, Masoud Salehi, Gabriele Nebe:
Interleaver design for turbo codes. IEEE J. Sel. Areas Commun. 19(5): 831-837 (2001) - [j85]Vinay A. Vaishampayan, Neil J. A. Sloane, Sergio D. Servetto:
Multiple-description vector quantization with lattice codebooks: Design and analysis. IEEE Trans. Inf. Theory 47(5): 1718-1734 (2001) - 2000
- [c9]Suhas N. Diggavi, Neil J. A. Sloane, Vinay A. Vaishampayan:
Design of Asymmetric Multiple Description Lattice Vector Quantizers. Data Compression Conference 2000: 490-499 - [c8]Hamid R. Sadjadpour, M. Salehi, Neil J. A. Sloane, Gabriele Nebe:
Interleaver Design for Short Block Length Turbo Codes. ICC (2) 2000: 628-632 - 1999
- [c7]Sergio D. Servetto, Vinay A. Vaishampayan, Neil J. A. Sloane:
Multiple Description Lattice Vector Quantization. Data Compression Conference 1999: 13-22 - 1998
- [j84]Yves Edel, Eric M. Rains, Neil J. A. Sloane:
On Kissing Numbers in Dimensions 32 to 128. Electron. J. Comb. 5 (1998) - [j83]Andries E. Brouwer, Heikki O. Hämäläinen, Patric R. J. Östergård, Neil J. A. Sloane:
Bounds on Mixed Binary/Ternary Codes. IEEE Trans. Inf. Theory 44(1): 140-161 (1998) - [j82]A. Robert Calderbank, Eric M. Rains, Peter W. Shor, Neil J. A. Sloane:
Quantum Error Correction Via Codes Over GF(4). IEEE Trans. Inf. Theory 44(4): 1369-1387 (1998) - 1997
- [j81]Mira Bernstein, Neil J. A. Sloane, Paul E. Wright:
On sublattices of the hexagonal lattice. Discret. Math. 170(1-3): 29-39 (1997) - [j80]John H. Conway, Ronald H. Hardin, Neil J. A. Sloane:
Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces. Exp. Math. 6(2): 175 (1997) - 1996
- [j79]Ronald H. Hardin, Neil J. A. Sloane:
McLaren's Improved Snub Cube and Other New Spherical Designs in Three Dimensions. Discret. Comput. Geom. 15(4): 429-441 (1996) - [j78]John H. Conway, Ronald H. Hardin, Neil J. A. Sloane:
Packing Lines, Planes, etc.: Packings in Grassmannian Spaces. Exp. Math. 5(2): 139-159 (1996) - [j76]A. Robert Calderbank, Neil J. A. Sloane:
The ternary Golay code, the integers mod 9, and the Coxeter-Todd lattice. IEEE Trans. Inf. Theory 42(2): 636-637 (1996) - 1995
- [j75]A. Robert Calderbank, Neil J. A. Sloane:
Modular and p-adic Cyclic Codes. Des. Codes Cryptogr. 6(1): 21-35 (1995) - [j74]John H. Conway, Neil J. A. Sloane:
What are All the Best Sphere Packings n Low Dimensions?. Discret. Comput. Geom. 13: 383-403 (1995) - [j73]Neil J. A. Sloane, Ronald H. Hardin, T. D. S. Duff, John H. Conway:
Minimal-Energy Clusters of Hard Spheres. Discret. Comput. Geom. 14(3): 237-259 (1995) - 1994
- [j71]John H. Conway, Neil J. A. Sloane:
Quaternary Constructions for the Binary Single-Error-Correcting Codes of Julin, Best and Others. Des. Codes Cryptogr. 4(1): 31-42 (1994) - [j70]Ronald H. Hardin, Neil J. A. Sloane:
Expressing (a2 + b2 + c2 + d2)3 as a Sum of 23 Sixth Powers. J. Comb. Theory A 68(2): 481-485 (1994) - [j69]A. Roger Hammons Jr., P. Vijay Kumar, A. Robert Calderbank, Neil J. A. Sloane, Patrick Solé:
The Z4-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40(2): 301-319 (1994) - 1993
- [j68]John H. Conway, Neil J. A. Sloane:
Self-Dual Codes over the Integers Modulo 4. J. Comb. Theory A 62(1): 30-45 (1993) - [c5]A. Roger Hammons Jr., P. Vijay Kumar, A. Robert Calderbank, Neil J. A. Sloane, Patrick Solé:
On the Apparent Duality of the Kerdock and Preparata Codes. AAECC 1993: 13-24 - [i1]A. Robert Calderbank, A. Roger Hammons Jr., P. Vijay Kumar, Neil J. A. Sloane, Patrick Solé:
A linear construction for certain Kerdock and Preparata codes. CoRR abs/math/9310227 (1993) - 1992
- [j67]John H. Conway, Neil J. A. Sloane:
On the Covering Multiplicity of Lattices. Discret. Comput. Geom. 8: 109-130 (1992) - [j66]Ronald H. Hardin, Neil J. A. Sloane:
New spherical 4-designs. Discret. Math. 106-107: 255-264 (1992) - [j65]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 A 60(2): 183-195 (1992) - [c4]G. David Forney Jr., Neil J. A. Sloane, Mitchell D. Trott:
The Nordstrom-Robinson Code is the Binary Image of 19 the Octacode. Coding And Quantization 1992: 19-26 - 1991
- [j64]A. Robert Calderbank, Philippe Delsarte, Neil J. A. Sloane:
A strengthening of the Assmus-Mattson theorem. IEEE Trans. Inf. Theory 37(5): 1261-1268 (1991) - 1990
- [j63]Ronald L. Graham, Neil J. A. Sloane:
Penny-Packing and Two-Dimensional Codes. Discret. Comput. Geom. 5: 1-11 (1990) - [j61]John H. Conway, Samuel J. Lomonaco, Neil J. A. Sloane:
A [45, 13] code with minimal distance 16. Discret. Math. 83(2-3): 213-217 (1990) - [j60]John H. Conway, Neil J. A. Sloane:
Orbit and coset analysis of the Golay and related codes. IEEE Trans. Inf. Theory 36(5): 1038-1050 (1990) - [j59]John H. Conway, Neil J. A. Sloane:
A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36(6): 1319-1333 (1990) - [j58]Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith:
A new table of constant weight codes. IEEE Trans. Inf. Theory 36(6): 1334-1380 (1990) - 1989
- [j57]Peter C. Fishburn, Neil J. A. Sloane:
The solution to Berlekamp's switching game. Discret. Math. 74(3): 263-290 (1989) - [j56]John H. Conway, Neil J. A. Sloane, Allan R. Wilks:
Gray codes for reflection groups. Graphs Comb. 5(1): 315-325 (1989) - 1988
- [b1]John H. Conway, Neil J. A. Sloane:
Sphere Packings, Lattices and Groups. Grundlehren der mathematischen Wissenschaften 290, Springer 1988, ISBN 978-1-4757-2018-1, pp. 1-665 - [j54]A. Robert Calderbank, Neil J. A. Sloane:
Inequalities for covering codes. IEEE Trans. Inf. Theory 34(5): 1276-1280 (1988) - 1987
- [j52]A. Robert Calderbank, Neil J. A. Sloane:
New trellis codes based on lattices and cosets. IEEE Trans. Inf. Theory 33(2): 177-195 (1987) - 1986
- [j50]A. Robert Calderbank, Neil J. A. Sloane:
An eight-dimensional trellis code. Proc. IEEE 74(5): 757-759 (1986) - [j49]John H. Conway, Neil J. A. Sloane:
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice. IEEE Trans. Inf. Theory 32(1): 41-50 (1986) - [j48]John H. Conway, Neil J. A. Sloane:
Lexicographic codes: Error-correcting codes from game theory. IEEE Trans. Inf. Theory 32(3): 337-348 (1986) - [j47]Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
Further results on the covering radius of codes. IEEE Trans. Inf. Theory 32(5): 680-694 (1986) - 1985
- [j46]A. Robert Calderbank, Neil J. A. Sloane:
Four-dimensional modulation with an eight-state trellis code. AT&T Tech. J. 64(5): 1005-1018 (1985) - [j45]James A. Reeds, Neil J. A. Sloane:
Shift-Register Synthesis (Modulo m). SIAM J. Comput. 14(3): 505-513 (1985) - [j44]John H. Conway, Neil J. A. Sloane:
A lower bound on the average error of vector quantizers. IEEE Trans. Inf. Theory 31(1): 106-109 (1985) - [j43]Ronald L. Graham, Neil J. A. Sloane:
On the covering radius of codes. IEEE Trans. Inf. Theory 31(3): 385-401 (1985) - 1984
- [c3]Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
On a conjecture concerning coverings of Hamming space. AAECC 1984: 79-89 - 1983
- [j38]Neil J. A. Sloane, John G. Thompson:
Cyclic self-dual codes. IEEE Trans. Inf. Theory 29(3): 364-366 (1983) - [j37]John H. Conway, Neil J. A. Sloane:
A fast encoding method for lattice codes and quantizers. IEEE Trans. Inf. Theory 29(6): 820-824 (1983) - [c2]James A. Reeds, Neil J. A. Sloane:
Shift-Register Synthesis (Modula m). CRYPTO 1983: 249 - 1982
- [j34]John H. Conway, Neil J. A. Sloane:
The Unimodular Lattices of Dimension up to 23 and the Minkowski-Siegel Mass Constants. Eur. J. Comb. 3(3): 219-231 (1982) - [j33]Jeffrey S. Leon, Vera Pless, Neil J. A. Sloane:
Self-Dual Codes over GF(5). J. Comb. Theory A 32(2): 178-194 (1982) - [j32]John H. Conway, Neil J. A. Sloane:
Voronoi regions of lattices, second moments of polytopes, and quantization. IEEE Trans. Inf. Theory 28(2): 211-226 (1982) - [j31]John H. Conway, Neil J. A. Sloane:
Fast quantizing and decoding and algorithms for lattice quantizers and codes. IEEE Trans. Inf. Theory 28(2): 227-231 (1982) - 1981
- [j29]Neil J. A. Sloane, John G. Thompson:
The Nonexistence of a Certain Steiner System. J. Comb. Theory A 30(3): 209-236 (1981) - [j28]Jeffrey S. Leon, Vera Pless, Neil J. A. Sloane:
On ternary self-dual codes of length 24. IEEE Trans. Inf. Theory 27(2): 176-180 (1981) - 1980
- [j24]Ronald L. Graham, Neil J. A. Sloane:
On Additive Bases and Harmonious Graphs. SIAM J. Algebraic Discret. Methods 1(4): 382-404 (1980) - [j23]Ronald L. Graham, Neil J. A. Sloane:
Lower bounds for constant weight codes. IEEE Trans. Inf. Theory 26(1): 37-43 (1980) - [j22]Vera Pless, Neil J. A. Sloane, Harold N. Ward:
Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20. IEEE Trans. Inf. Theory 26(3): 305-316 (1980) - 1979
- [j21]Andrew M. Odlyzko, Neil J. A. Sloane:
New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions. J. Comb. Theory A 26(2): 210-214 (1979) - [j20]John H. Conway, Vera Pless, Neil J. A. Sloane:
Self-dual codes over GF(3) and GF(4) of length not exceeding 16. IEEE Trans. Inf. Theory 25(3): 312-322 (1979) - 1978
- [j19]F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane, Harold N. Ward:
Self-Dual Codes over GF(4). J. Comb. Theory A 25(3): 288-318 (1978) - [j18]Marc R. Best, Andries E. Brouwer, F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane:
Bounds for binary codes of length less than 25. IEEE Trans. Inf. Theory 24(1): 81-93 (1978) - 1977
- [j17]Robert H. Morris Sr., Neil J. A. Sloane, Aaron D. Wyner:
Assessment of the National Bureau of Standards Proposed Federal Data Encryption Standard. Cryptologia 1(3): 281-291 (1977) - 1975
- [j15]Vera Pless, Neil J. A. Sloane:
On the Classification and Enumeration of Self-Dual Codes. J. Comb. Theory A 18(3): 313-335 (1975) - [j14]Colin L. Mallows, Andrew M. Odlyzko, Neil J. A. Sloane:
An upper bound for self-dual codes (Corresp.). IEEE Trans. Inf. Theory 21(1): 115 (1975) - 1974
- [j13]Colin L. Mallows, Neil J. A. Sloane:
Weight enumerators of self-orthogonal codes. Discret. Math. 9(4): 391-400 (1974) - 1973
- [j12]Colin L. Mallows, Neil J. A. Sloane:
An Upper Bound for Self-Dual Codes. Inf. Control. 22(2): 188-200 (1973) - [j11]F. Jessie MacWilliams, Neil J. A. Sloane, John G. Thompson:
On the Existence of a Projective Plane of Order 10. J. Comb. Theory A 14(1): 66-78 (1973) - 1972
- [j9]F. Jessie MacWilliams, Neil J. A. Sloane, John G. Thompson:
Good self dual codes exist. Discret. Math. 3(1-3): 153-162 (1972) - [j7]Robert P. Kurshan, Neil J. A. Sloane:
Coset Analysis of Reed Muller Codes Via Translates of Finite Vector Spaces. Inf. Control. 20(5): 410-414 (1972) - [j6]Elwyn R. Berlekamp, F. Jessie MacWilliams, Neil J. A. Sloane:
Gleason's theorem on self-dual codes. IEEE Trans. Inf. Theory 18(3): 409-414 (1972) - [j4]F. Jessie MacWilliams, Colin L. Mallows, Neil J. A. Sloane:
Generalizations of Gleason's theorem on weight enumerators of self-dual codes. IEEE Trans. Inf. Theory 18(6): 794-805 (1972) - 1970
- [j2]Neil J. A. Sloane, Elwyn R. Berlekamp:
Weight enumerator for second-order Reed-Muller codes. IEEE Trans. Inf. Theory 16(6): 745-751 (1970) - 1969
- [j1]Elwyn R. Berlekamp, Neil J. A. Sloane:
Restrictions on Weight Distribution of Reed-Muller Codes. Inf. Control. 14(5): 442-456 (1969)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
