In earlier papers the author developed upper bounds for A(n, d), the maximum number of binary words of length n, each pair of words being at a Hamming distance of at least d apart. These sphere packing bounds for A(n, d) depend directly on a related bound for constant weight codes where each word has the same number of 1's. Improving bounds on constant weight codes would therefore improve the bounds on A(n, d). This was the motivation of this report, but constant weight codes are interesting in their own right. By combining special techniques from several sources, a new upper bound for constant weight codes is developed which gives significantly improved results.
This report is part of the RAND Corporation Report series. The report was a product of the RAND Corporation from 1948 to 1993 that represented the principal publication documenting and transmitting RAND's major research findings and final research.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.