Skip to search formSkip to main contentSkip to account menu

Shannon–Fano coding

Known as: Data compression/Shannon-Fano coding, Shannon-Fano coding, Shannon-fano 
In the field of data compression, Shannon–Fano coding, named after Claude Shannon and Robert Fano, is a technique for constructing a prefix code… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
A Mathematical Theory of CommunicationArithmetic codingData compressionHuffman coding

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Modified Linguistic Steganography Approach by Using Syntax Bank and Digital Signature
  Abstract—In today digital age, there are more demands to improve techniques for information security. Steganography is one of… 
2007
2007
Reconfigurable Hardware Architectures for Sequential and Hybrid Decoding
A novel reconfigurable sequential decoder architecture based on the Fano algorithm is presented in which the constraint length… 
2007
2007
Data Compression Coding Using Static and Dynamic Method of Shannon-fano Algorithm
Tulisan ini membahas tentang teknik kompresi data dengan menggunakan metode shannon-fano dengan membandingkan antara teknik… 
2006
2006
Using Improved Shannon-Fano-Elias Codes for Data Encryption
We consider using Shannon-Fano-Elias codes for data encryption. In many applications both compression and security are required… 
2006
2006
Stationary queue-size distribution for variable complexity sequential decoders with large timeout
Fano decoders are convolutional channel decoders having variable decoding complexity in changing channel conditions. Buffers are… 
2005
2005
Implementation cost of the Huffman-Shannon-Fano code
An efficient implementation of a Huffman code can be based on the Shannon-Fano construction. An important question is exactly how… 
2005
2005
Cryptanalysis of Shannon-Fano-Elias codes
Data compression techniques such as Shannon-Fano-Elias coding are often used in conjunction with cryptography. We discuss using… 
2001
2001
Buffer control for variable complexity Fano decoders
Fano sequential decoders are variable complexity convolutional decoders, which have the desirable property of operating with very… 
Highly Cited
1973
Highly Cited
1973
A Huffman-Shannon-Fano code
A variable-word-length minimum-redundant code is described. It has the advantages of both the Huffman and Shannon-Fano codes in… 
1973
1973
Data compression techniques as a means of reducing the storage requirements for satellite data: a quantitative comparison
This paper reports on an investigation into the application of data compression techniques as a means of reducing the ‘on-ground… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)