Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!brunix!doorknob!pgh From: pgh@cs.brown.edu (Paul Howard) Newsgroups: comp.databases Subject: Re: In Search Of a key compression algorithm! (redirected) Message-ID: Date: 3 Jun 91 14:49:32 GMT References: <6301@ns-mx.uiowa.edu> Sender: news@brunix.UUCP Followup-To: comp.databases Distribution: comp Organization: Department of Compute Science, Brown University Lines: 15 In-reply-to: jones@pyrite.cs.uiowa.edu's message of 2 Jun 91 19:15:32 GMT Knuth Volume III (Sorting and Searching) describes the Hu-Tucker algorithm, a prefix code that preserves lex order. This may be similar to the Garcia Wachs algorithm mentioned by Doug Jones. I would just use arithmetic coding. -- Paul -- ============================================================= Paul G. Howard email: pgh@cs.brown.edu Department of Computer Science phone: (401) 863-7672 Brown University FAX: (401) 863-7657 Providence RI 02912-1910 ham: KA1YNE