Scribd
Upload
98 views2 pages

Huffman Encoding: 'A' 'B' 'C' 'D' 'E' 'F'

This document describes Huffman encoding, which is an algorithm for compressing data. It works by assigning variable-length binary codes to input characters, where the most common characters get shorter codes. It builds a Huffman tree from character frequencies, assigns codes by traversing the tree, encodes a string by replacing characters with their codes, and decodes an encoded string by traversing the tree with the codes. The example shows building a tree from character frequencies, assigning codes, encoding and decoding a short string.

Uploaded by

Rama Sugavanam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
98 views2 pages

Huffman Encoding: 'A' 'B' 'C' 'D' 'E' 'F'

This document describes Huffman encoding, which is an algorithm for compressing data. It works by assigning variable-length binary codes to input characters, where the most common characters get shorter codes. It builds a Huffman tree from character frequencies, assigns codes by traversing the tree, encodes a string by replacing characters with their codes, and decodes an encoded string by traversing the tree with the codes. The example shows building a tree from character frequencies, assigning codes, encoding and decoding a short string.

Uploaded by

Rama Sugavanam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Huffman encoding

freq=[]
codes={}
freq = [(30, 'a'), (30, 'b'), (13, 'c'), (12, 'd'), (10, 'e'),(5,'f') ]

for i in sorted(freq):
print i[1],i[0]
tuples=freq
def buildTree(tuples) :
while len(tuples) > 1 :
leastTwo = tuple(tuples[0:2]) # get the 2 to combine
theRest = tuples[2:] # all the others
combFreq = leastTwo[0][0] + leastTwo[1][0] # the branch points freq
tuples = theRest + [(combFreq,leastTwo)] # add branch point to the end
tuples.sort() # sort it into place

return tuples[0] # Return the single tree inside the list

def trimTree(tree):
# Trim the freq counters off, leaving just the letters
p = tree[1] # ignore freq count in [0]
if type(p) == type(""):
return p # if just a leaf, return it
else:
return (trimTree(p[0]), trimTree(p[1])) # trim left then right and recombine

def assignCodes(node, pat=''):


global codes
if type(node) == type(""):
codes[node] = pat # A leaf. set its code
else: #
assignCodes(node[0], pat + "0") # Branch point. Do the left branch
assignCodes(node[1], pat + "1") # then do the right branch.

def encode (str) :


output = ""
for ch in str : output += codes[ch]
return output

def decode (tree, str) :


output = ""
p = tree
for bit in str :
if bit == '0' : p = p[0] # Head up the left branch
else : p = p[1] # or up the right branch
if type(p) == type("") :
output += p # found a character. Add to output
p = tree # and restart for next character
return output

tree = buildTree(tuples)
tree = trimTree(tree)
print "Trimmed tree", tree
assignCodes(tree)
print codes
en=encode('add')
print 'add encoded as ' ,en
de = decode(tree, en)
print "decoded ", de

You might also like