CSCE 110 Lecture Notes - Lecture 3: Huffman Coding, Binary Code, Error Detection And Correction

53 views1 pages

Document Summary

Diffe(cid:396)e(cid:374)t t(cid:455)pes of (cid:272)o(cid:373)p(cid:396)essio(cid:374): (1) lossy (all the examples above) (2) lossless like the example to right. Also, . zip files use a combination of limpel-ziv and huffman coding (both are lossless): digitizatio(cid:374) has (cid:373)a(cid:374)(cid:455) othe(cid:396) (cid:271)e(cid:374)efits too, e. g. , add (cid:271)its fo(cid:396) e(cid:396)(cid:396)o(cid:396) dete(cid:272)tio(cid:374) a(cid:374)d/o(cid:396) (cid:272)o(cid:396)(cid:396)e(cid:272)tio(cid:374), encryption, digital signatures. How do we encode data as binary for our digital system: o(cid:373)e i(cid:374)puts i(cid:374)he(cid:396)e(cid:374)tl(cid:455) (cid:271)i(cid:374)a(cid:396)(cid:455) Button: not pressed (0), pressed (1: o(cid:373)e i(cid:374)puts i(cid:374)he(cid:396)e(cid:374)tl(cid:455) digital. E. g. , multi-button input: encode red=001, blue=010: o(cid:373)e i(cid:374)puts a(cid:374)alog.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers