Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!utcsri!arvind
From: arvind@utcsri.UUCP
Newsgroups: ut.theory
Subject: THEORY NET: Error Correcting Codes
Message-ID: <5571@utcsri.UUCP>
Date: Sun, 25-Oct-87 11:05:59 EST
Article-I.D.: utcsri.5571
Posted: Sun Oct 25 11:05:59 1987
Date-Received: Mon, 26-Oct-87 06:47:02 EST
Distribution: ut
Organization: CSRI, University of Toronto
Lines: 20

Date:         23 Oct 1987 13:57:46-EDT (Friday)
From: Sandeep Sen <DUKE!SS@mcnc.org>
Subject:      Error-correcting codes

     
 I need some information regarding the best known bounds for maximizing the
(Hamming) distance between two k bit 0-1 codes when the number of
k-bit code words is N (N << 2 sup k).
         To be more precise, given 'N' 0-1 vectors of length 'k',
I need to maximize the distance 'd' between the closest pair.
(This is also known as the sphere-packing problem).
     
Please send your replies by e-mail to ss@cs.duke.edu. Any references
to improvement in bounds over Hamming's original paper
will be greatly appreciated.
--
--------------------------------------------------------------------------
arpa  : ss@cs.duke.edu         | us-snail: 311 s.la salle st.
csnet : ss@duke                |           apt 14e. durham nc 27705.
uucp  : ...decvax!mcnc!duke!ss |           (919)-383-0119.