A Huffman-Shannon-Fano code

1973/01/01 by J.B. Connell · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Algorithm #Algorithms and Data Compression #Arithmetic #Artificial intelligence #Block code #Canonical Huffman code #Code (set theory) #Code rate #Code word #Computer science #Concatenated error correction code #Data compression #Decoding methods #Encoding (memory) #Error Correcting Code Techniques #Fano plane #Huffman coding #Mathematics #Prefix code #Pure mathematics #Systematic code #Telecommunications #Transmission (telecommunications) #Variable-length code

paper · doi:10.1109/proc.1973.9200

openalex publication_date 1973/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/04/09

Abstract

A variable-word-length minimum-redundant code is described. It has the advantages of both the Huffman and Shannon-Fano codes in that it reduces transmission time, storage space, translation table space, and encoding and decoding times.

Cited by

• Vertical lossless genomic data compression tools for assembled genomes: A systematic literature review. [europepmc]

Related

• An Alternative to Huffman's Algorithm for Constructing Variable-Length Codes
• COMPARATIVE ANALYSIS AND PERFORMANCE EVALUATION OF HUFFMAN AND SHANNON FANO DATA COMPRESSION ALGORITHMS USING THE REDUCTION OF STORAGE SIZE OF A GIVEN DATA STRING.
• Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes
• Competitive Advantage of Huffman and Shannon-Fano Codes
• Dynamic Shannon Coding