arvind@utcsri.UUCP (10/25/87)
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.