EECS 1520 Lecture Notes - Lecture 5: No Code, Huffman Coding, Lossless Compression

• School: York University
• Department: Electrical Engineering and Computer Science
• Course: EECS 1520
• Professor: Avi Cohen

Document Summary

List of characters and the codes used to represent each one. The fi(cid:396)st (cid:1007)(cid:1006) (cid:272)o(cid:374)t(cid:396)ol (cid:272)ha(cid:396)a(cid:272)te(cid:396)s (cid:272)o(cid:374)t(cid:396)ol ho(cid:449) the te(cid:454)t appea(cid:396)s (cid:271)ut do(cid:374)(cid:859)t appea(cid:396) as te(cid:454)t. They start at code 48, you add whichever regular number to 48 to get the new number. They start at 65, to figure out the code for a number, do: 65 +(10-_) They start at 97, to figure out the code for a number, do: 97 +(10-_) It uses 16 bits per character and can represent 2^16, or over 65 thousand characters. True of false: unicode is a superset of ascii. True, the first 256 characters in the unicode character set corresponds exactly to the extended. Symbol or smiley typically appearing in electronic messages. The appearance is implementation specific, meaning they look different depending on the device. Reduction in the amount of space needed to store a piece of data. The size of the compressed data divided by the size of the original data.