https://github.com/domamaric/tinf-lab
Solution to laboratory exercise for Information Theory course at FER.
https://github.com/domamaric/tinf-lab
huffman-algorithm huffman-coding huffman-tree
Last synced: 8 months ago
JSON representation
Solution to laboratory exercise for Information Theory course at FER.
- Host: GitHub
- URL: https://github.com/domamaric/tinf-lab
- Owner: domamaric
- Created: 2020-11-16T16:02:38.000Z (almost 5 years ago)
- Default Branch: master
- Last Pushed: 2021-06-09T19:15:27.000Z (over 4 years ago)
- Last Synced: 2025-01-05T20:42:26.133Z (10 months ago)
- Topics: huffman-algorithm, huffman-coding, huffman-tree
- Language: Python
- Homepage:
- Size: 4.88 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## TINF-lab ##
:computer: Zadatak iz laboratorijske vježbe iz predmeta Teorija informacije na [FER](https://www.fer.unizg.hr/)-u
2020/2021. godine. U nastavku slijedi tekst zadatka:
**Z04: Huffman**
Bezmemorijsko izvorište generira simbole iz skupa simbola *X={a, b, c, ...}* s vjerojatnostima
pojavljivanja *p(a), p(b), p(c), ...*
1) Kodirajte zadani skup simbola Huffmanovom metodom entropijskog kodiranja (binarnokodiranje).
2) Odredite srednju duljinu kodne riječi te efikasnost koda.
**Napomena:**
Programski kôd zadatka mora omogućiti unos proizvoljnog broja ulaznih simbola tj. njihovih
vjerojatnosti pojavljivanja. Po unosu svih potrebnih parametara i izračunu svih podzadataka 1) i 2)
potrebno je ispisati rješenja istih.