article

Free access

Generating a canonical prefix encoding

Authors:

Eugene S. Schwartz and

Bruce KallickAuthors Info & Claims

Communications of the ACM, Volume 7, Issue 3

Pages 166 - 169

https://doi.org/10.1145/363958.363991

Published: 01 March 1964 Publication History

PDF eReader

Abstract

Computer programs for generating a minimum-redundancy exhaustive prefix encoding are described. One program generates a Huffman frequency tree, another determines the structure functions of an encoding, and a third program assigns codes.

References

[1]

SHANNON, C. E. A mathematical theory of communication. Bell System Tech. J. 27 (1948), 379-423, 623-656.

Google Scholar

[2]

FANO, R. M. Res. Lab. for Electronics, Mass. Inst. Technology, Techn. Rep. No. 65, 1949.

Google Scholar

[3]

HUFFMAN, D. A. A method for the construction of minimumredundancy codes. Proc. IRE 40 (1952), 1098-1101.

Crossref

Google Scholar

[4]

GILBERT, E. N. AND MOORE, E. F. Variable length binary encodings. Bell System Tech. J. 38 (1959), 933-967.

Crossref

Google Scholar

[5]

KARP, R. S. Minimum-redundancy coding for the discrete noiseless channel. Trans. IRE, IT-7 (1961), 27-38.

Google Scholar

[6]

SCHWARTZ, E. S. An adaptive information transmission system employing minimum-redundancy word codes. Armour Research Foundation, Techn. Doc. Bep. ASD-TDR-62- 265, Pt. 11, June 1963.

Google Scholar

[7]

SCHWARTZ, E. S. An optimum encoding with minimum longest code and total number of digits. Inform. Contr. (to be published).

Google Scholar

Cited By

View all

Shi YZou XChen XJin STao DDeng CChen YXia W(2024)Machete: An Efficient Lossy Floating-Point Compressor Designed for Time Series Databases2024 Data Compression Conference (DCC)10.1109/DCC58796.2024.00061(532-541)Online publication date: 19-Mar-2024
https://doi.org/10.1109/DCC58796.2024.00061
Shah MYu XDi SBecchi MCappello FGallivan KNikolopoulos DBeivide RGallopoulos E(2023)Lightweight Huffman Coding for Efficient GPU CompressionProceedings of the 37th International Conference on Supercomputing10.1145/3577193.3593736(99-110)Online publication date: 21-Jun-2023
https://dl.acm.org/doi/10.1145/3577193.3593736
Wang NYan WJiang HLin SHan Y(2023)Prefix Coding Scheme Supporting Direct Access Without Auxiliary SpaceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.327111135:12(12917-12931)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TKDE.2023.3271111
Show More Cited By

Index Terms

Generating a canonical prefix encoding

Recommendations

Online prefix-free encoding algorithm
SPPRA'06: Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications

The well-known Huffman encoding algorithm explicitly constructs the optimal codes. However, in the context of data communications, data encoded are usually online sent from one to another source. The Huffman algorithm is clearly inappropriate for online ...
Read More
Efficient and compact representations of some non-canonical prefix-free codes
Abstract
For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when we can choose the order ...
Read More
A hybrid code compression technique using bitmask and prefix encoding with enhanced dictionary selection
CASES '07: Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems

Memory is one of the most significant detrimental factors in increasing the cost and area of embedded systems, especially assemiconductor technology scales down. Code compression techniques have been employed to reduce the memory requirement of the ...
Read More

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 7, Issue 3

March 1964

77 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/363958

Editor:
C. C. Gotlieb
Univ. of Toronto, Toronto, Canada

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1964

Published in CACM Volume 7, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

129
Total Citations
View Citations
1,369
Total Downloads

Downloads (Last 12 months)218
Downloads (Last 6 weeks)20

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shi YZou XChen XJin STao DDeng CChen YXia W(2024)Machete: An Efficient Lossy Floating-Point Compressor Designed for Time Series Databases2024 Data Compression Conference (DCC)10.1109/DCC58796.2024.00061(532-541)Online publication date: 19-Mar-2024
https://doi.org/10.1109/DCC58796.2024.00061
Shah MYu XDi SBecchi MCappello FGallivan KNikolopoulos DBeivide RGallopoulos E(2023)Lightweight Huffman Coding for Efficient GPU CompressionProceedings of the 37th International Conference on Supercomputing10.1145/3577193.3593736(99-110)Online publication date: 21-Jun-2023
https://dl.acm.org/doi/10.1145/3577193.3593736
Wang NYan WJiang HLin SHan Y(2023)Prefix Coding Scheme Supporting Direct Access Without Auxiliary SpaceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.327111135:12(12917-12931)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TKDE.2023.3271111
Beysens JSénéclauze MDallemagne PBigdeli S(2023)Early Exiting with Compressible Activations for Efficient Neural Network Inference2023 Smart Systems Integration Conference and Exhibition (SSI)10.1109/SSI58917.2023.10387760(1-7)Online publication date: 28-Mar-2023
https://doi.org/10.1109/SSI58917.2023.10387760
Allahverdyan AKhachatryan A(2023)Optimal alphabet for single text compressionInformation Sciences10.1016/j.ins.2022.10.104621(458-473)Online publication date: Apr-2023
https://doi.org/10.1016/j.ins.2022.10.104
Fariña AGagie TGrabowski SManzini GNavarro GOrdóñez A(2022)Efficient and compact representations of some non-canonical prefix-free codesTheoretical Computer Science10.1016/j.tcs.2022.01.010907:C(11-25)Online publication date: 12-Mar-2022
https://dl.acm.org/doi/10.1016/j.tcs.2022.01.010
Grabowski SKöppl D(2022)Space-efficient Huffman codes revisitedInformation Processing Letters10.1016/j.ipl.2022.106274179:COnline publication date: 15-Nov-2022
https://dl.acm.org/doi/10.1016/j.ipl.2022.106274
Tian JRivera CDi SChen JLiang XTao DCappello F(2021)Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS49936.2021.00097(881-891)Online publication date: May-2021
https://doi.org/10.1109/IPDPS49936.2021.00097
Diaz-Dominguez DNavarro G(2021)A grammar compressor for collections of reads with applications to the construction of the BWT2021 Data Compression Conference (DCC)10.1109/DCC50243.2021.00016(83-92)Online publication date: Mar-2021
https://doi.org/10.1109/DCC50243.2021.00016
Niu TYang F(2021)An Entropy-Based Approach: Compressing Names for NDN LookupIEEE Access10.1109/ACCESS.2021.31015789(109833-109846)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3101578
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Online prefix-free encoding algorithm

Efficient and compact representations of some non-canonical prefix-free codes

A hybrid code compression technique using bitmask and prefix encoding with enhanced dictionary selection

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations