CoursInformatique/Images/.svn/text-base/FF.txt.svn-base
2019-12-12 22:25:13 +01:00

40 lines
1.1 KiB
Plaintext

42 4d de 00 00 00 00 00 00 00 36 00 00 00 28 00
00 00 07 00 00 00 07 00 00 00 01 00 18 00 00 00
00 00 a8 00 00 00 13 0b 00 00 13 0b 00 00 00 00
00 00 00 00 00 00 00 ff 00 00 87 00 ff ff ff ff
ff ff ff ff ff ff ff ff ff ff ff 00 00 00 00 ff
00 00 87 00 ff ff ff ff ff ff ff ff ff ff ff ff
ff ff ff 00 00 00 00 ff 00 00 87 00 00 87 00 ff
ff ff ff ff ff ff ff ff ff ff ff 00 00 00 00 ff
00 00 ff 00 00 ff 00 00 ff 00 ff ff ff ff ff ff
ff ff ff 00 00 00 00 ff 00 00 87 00 ff ff ff ff
ff ff ff ff ff ff ff ff ff ff ff 00 00 00 00 ff
00 00 87 00 00 87 00 00 87 00 00 87 00 00 87 00
ff ff ff 00 00 00 00 ff 00 00 ff 00 00 ff 00 00
ff 00 00 ff 00 00 ff 00 00 ff 00 00 00 00
Lettre Fréq Codage Nb bits
4 2 11111110 8x2=16
2 2 1111110 7x2=14
d 1 111111110 9x1=9
e 1 1111111110 10x1=10
0 226 0 1x226=226
3 2 111110 6x2=12
6 1 11111111110 11x1=11
8 13 110 3x13=39
7 12 1110 4x12=48
1 3 11110 5x3=15
a 1 111111111110 12x1=12
b 1 1111111111110 13x1=13
f 170 10 2x170=340
Soit 16+14+...=765 bits
Au lieu de :
16x14-2=222 octets
soit 222x8=1776 bits
11111110|1111110|11111110|111111110 ...
Gain : 57%
Sans l'arbre de Huffmann