5 citations · 21 across the 11 of their papers we have counts for
7 papers · 1 filter
The Gift Exchange Problem
David Applegate, N. J. A. Sloane
The aim of this paper is to solve the "gift exchange" problem: you are one of n players, and there are n wrapped gifts on display; when your turn comes, you can either choose any o…
Gleason's Theorem on Self-Dual Codes and Its Generalizations
N. J. A. Sloane
One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of pap…
A Family of Optimal Packings in Grassmannian Manifolds
P. W. Shor, N. J. A. Sloane
A remarkable coincidence has led to the discovery of a family of packings of (m^2+m-2) m/2-dimensional subspaces of m-dimensional space, whenever m is a power of 2. These packings…
Self-Dual Codes
E. M. Rains, N. J. A. Sloane
Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2,…
Interleaver Design for Turbo Codes
H. R. Sadjadpour, N. J. A. Sloane, M. Salehi +1
The performance of a Turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spe…
On Asymmetric Coverings and Covering Numbers
David Applegate, E. M. Rains, N. J. A. Sloane
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T| <= R. In…