Want this question answered?
Kodam
Huffman Coding is a method of shortening down messages sent from one computer to another so that it can be sent quicker.
huffman has a better compression rate.
1.the compression ratio is higher compared to huffman coding. 2.efficiency is greater comparatively. 3.Redundancy is much reduced.
lossless
golf
Algorithm is easy to implement Produce a lossless compression of images
Types of testing is broadly classified as Black box testing and white box testing
1) In Shannon-Fano coding, we cannot be sure about the codes generated. There may be two different codes for the same symbol depending on the way we build our tree. 2) Also, here we have no unique code i.e a code might be a prefix for another code. So in case of errors or loss during data transmission, we have to start from the beginning. 3) Shannon-Fano coding does not guarantee optimal codes. Hence, Shannon-Fano coding is not very efficient Huffman coding is more efficient than Shannon-Fano coding.
IBM compatible and non compatible
For coding
To compare cryptography and cryptology we must understand that they are about coding and ciphers. To contrast them, we must understand that cryptography involves the creation of codes and ciphers while cryptology is the study of them.