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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Compression in Information Technology is the way to minimize the file size. Performance of compression algorithm is measured by… 
2011
2011
  Abstract—In today digital age, there are more demands to improve techniques for information security. Steganography is one of… 
2011
2011
This paper presents a design of source encoding calculator software which applies the two famous algorithms in the field of… 
2007
2007
Tulisan ini membahas tentang teknik kompresi data dengan menggunakan metode shannon-fano dengan membandingkan antara teknik… 
2007
2007
A novel reconfigurable sequential decoder architecture based on the Fano algorithm is presented in which the constraint length… 
2007
2007
This paper demonstrates how techniques applicable for defining and maintaining a special case of binary search trees (BSTs) can… 
2005
2005
An efficient implementation of a Huffman code can be based on the Shannon-Fano construction. An important question is exactly how… 
2005
2005
Data compression techniques such as Shannon-Fano-Elias coding are often used in conjunction with cryptography. We discuss using… 
Highly Cited
1973
Highly Cited
1973
A variable-word-length minimum-redundant code is described. It has the advantages of both the Huffman and Shannon-Fano codes in… 
1973
1973
This paper reports on an investigation into the application of data compression techniques as a means of reducing the ‘on-ground…