Abstract
No public abstract is available from the verified source records.
Contact and support
Need help, have a question, or want to contact the ResearchHub team?
© 2026 ResearchHub. Built for responsible scholarly connection.
Privacy-aware community infrastructureAbraham Bookstein, Shmuel T. Klein, Timo Raita
Abstract
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
No local citing links have been materialized yet.
Unresolved referenced work
1965
Unresolved referenced work
1990
New Directions in Clustering
1995
Compression, Information Theory and Grammars, A Unified Approach
10.1145/78915.78917 · 1990
Is Huffman coding dead?
10.1007/bf02243872 · 1993
Data Compression Using Adaptive Coding and Partial String Matching
10.1109/tcom.1984.1096090 · 1984
Data Compression on a Database System
10.1145/214956.214963 · 1985
Unresolved referenced work
1990
A new vector quantization clustering algorithm
10.1109/29.35395 · 1989
Unresolved referenced work
1988
Variable-length Binary Encodings
10.1002/j.1538-7305.1959.tb01583.x · 1959
A method for the Construction of Minimum Redundancy Codes
1952
Unresolved referenced work
1973
Unresolved referenced work
1959
Universal Modeling and Coding
10.1109/tit.1981.1056282 · 1981
A Mathematical Theory of Communication
10.1002/j.1538-7305.1948.tb01338.x · 1948
A Mathematical Theory of Communication
10.1002/j.1538-7305.1948.tb00917.x · 1948
A Technique for High-Performance Data Compression
10.1109/mc.1984.1659158 · 1984
Unresolved referenced work
1994
A Universal Algorithm for Sequential Data Compression
10.1109/tit.1977.1055714 · 1977
No additional external references are available.