Scribd
Upload
39 views6 pages

يزﺎﺳ هدﺮﺸﻓ يﺎﻫ ﻢﺘﻳرﻮﮕﻟا) Huffman (

The document discusses data compression algorithms and specifically describes the Huffman coding algorithm. It explains that Huffman coding is a lossless compression technique that assigns variable-length codes to characters based on their frequency, allowing data to be compressed without loss. It has remained effective even 50 years after its invention due to its properties.

Uploaded by

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

يزﺎﺳ هدﺮﺸﻓ يﺎﻫ ﻢﺘﻳرﻮﮕﻟا) Huffman (

The document discusses data compression algorithms and specifically describes the Huffman coding algorithm. It explains that Huffman coding is a lossless compression technique that assigns variable-length codes to characters based on their frequency, allowing data to be compressed without loss. It has remained effective even 50 years after its invention due to its properties.

Uploaded by

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

)( Huffman

.

.
.
:

.
Huffman .
Huffman
) (David A. Huffman ) (1925-1999 .


.
Huffman





...
... .
:
-1 .
) (Symbols .
8 8= 23
ASCII
. 7 128

.
.
10 2000
.
.
-1 .
-2 .
Huffman .
. .
-1
-2

" "

.

.
.

1 100 :
Symbol Frequency of occurrence
a
40
b
30
c
10
d
10
e
6
f
4


. e
z .
Huffman .

.

n )
( 2n-1
.
:
-1
-2 ) (.
.
-3 2
-4



.
.

.

:

1 0
:
:
:
f,e 4 6
fe 10
ef c 10

adfecb.

:

.
.
f
f f -> fe -> fec -> dfec -> dfecb -> adfecb
1, 1, 0, 1, 0
01011 f
:
Symbol Frequency of occurrence Huffman code
a
40
1
b
30
00
c
10
0100
d
10
011
e
6
01010
f
4
01011

abdceabedf :
a b d
c
e a b
e
d
f
1 00 011 0100 01010 1 00 01010 011 01011

10 31 70 ASCII
% 20 %90
.

www.Arsanjan.blogfa.com .

You might also like