David Gillman, Ronald L. Rivest  Home/Search
Context Related
| mit.edu/~rivest/Gi...gthFixFreeCodes.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~rivest/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A set of codewords is fix-free if it is both prefix-free and suffix-free: no codeword in the set is a prefix or a suffix of any other. A set of codewords fx 1 ; x 2 ; : : : ; x n g over a t-letter alphabet \Sigma is said to be complete if it satisfies the Kraft inequality with equality, so that X 1in t \Gammajx i j = 1 : The set \Sigma k of all codewords of length k is obviously both fix-free and complete. We show, surprisingly, that there are other examples of complete fix-free codes,... (Update)
Context of citations to this paper: More
...f(n) 2f(n Gamma 1) if n is odd. For even n the set j S j j S n 0 j (see Theorem 3) for n = 8 and for all n 52. 2. In [4] one finds an example of a complete fix free code with the codeword lengths 2; 3; 3; 3; 3; 4; 4; 4; 4; We know from (i) of Proposition 1 that it is not...
Cited by: More
Improved Upper Bound for the Redundancy of Fix-Free Codes - Yekhanin (Correct)
Some properties of Fix-Free Codes - Ahlswede, Balkenhol, Khachatrian (1996) (Correct)
Active bibliography (related documents): More All
0.0: "Cost of knowledge" issues from specifications - Harold Thimbleby Computing (2000) (Correct)
0.0: On the redundancy achieved by Huffman codes - De Prisco, De Santis (1994) (Correct)
0.0: New Model for Arithmetic Coding/decoding of Multilevel.. - Osorio, Bruguera (1998) (Correct)
Similar documents based on text: More All
0.2: New Binary Fix-Free Codes with Kraft Sum 3/4 - Kukorelly, Zeger (2002) (Correct)
0.1: Very High Speed Entropy Coding - Boliek, al. (1994) (Correct)
0.1: On the Cryptanalysis of Huffman Codes - Mohtashemi (1992) (Correct)
BibTeX entry: (Update)
David Gillman and Ronald L. Rivest, Complete variable -- length fix -- free -- codes, Designs, Codes and Cryptography, 5, 109--114, 1995. 1995 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. http://citeseer.ist.psu.edu/gillman95complete.html More
@article{ gillman95complete,
author = "David Gillman and Ronald L. Rivest",
title = "Complete Variable-Length ``Fix-Free'' Codes",
journal = "Designs, Codes and Cryptography",
volume = "5",
number = "2",
pages = "109-114",
year = "1995",
url = "citeseer.ist.psu.edu/gillman95complete.html" }
Citations (may not include all citations):338 A method for the construction of minimum-redundancy codes (context) - Huffman - 1952
Documents on the same site (http://theory.lcs.mit.edu/~rivest/publications.html): More
Picking the Best Expert from a Sequence - Bergman, Rivest (1995) (Correct)
Game Tree Searching by Min/Max Approximation - Rivest (1995) (Correct)
Geometric Cryptography: Identification by Angle Trisection - Burmester, Rivest, Shamir (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC