Name
Abstract | ||
|---|---|---|
this paper, we presented a simple technique to generate L-restricted alphabetic prefix codes. Furthermore, weproved that the inefficiency of L-restricted alphabetic prefixcodes rather than Huffman codes is bounded above by1+1=/ |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/SPIRE.1999.796585 | SPIRE/CRIWG |
Keywords | Field | DocType |
l-restricted alphabetic prefix codes,practical constructions,shannon entropy,decoding,computational complexity,entropy,information retrieval systems,string matching,b trees,binary codes,data compression,huffman codes,information retrieval,prefix code | String searching algorithm,Computer science,Binary code,Block code,Algorithm,Prefix,Huffman coding,Kraft's inequality,Linear code,Prefix code | Conference |
ISBN | Citations | PageRank |
0-7695-0268-7 | 1 | 0.35 |
References | Authors | |
13 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eduardo Sany Laber | 1 | 229 | 27.12 |
| Ruy Luiz Milidiu | 2 | 9 | 2.29 |
| Artur Alves Pessoa | 3 | 270 | 24.30 |