D.11: Coding Theory, Compression and Cryptography
From
(→Resources for Coding, Compression and Cryptography) |
(→Discrete Math Learning modules) |
||
| Line 17: | Line 17: | ||
== Discrete Math Learning modules == | == Discrete Math Learning modules == | ||
| - | [[media:Coding_theory.pptx | Introduction to coding theory (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/><br/> | + | [[media:Coding_theory.pptx | Introduction to coding theory (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/> |
| + | [[Media:HuffmanEncoding.zip | Huffman encoding ppt, information links and sample java program]] | ||
| + | <br/><br/> | ||
== Resources for Coding, Compression and Cryptography == | == Resources for Coding, Compression and Cryptography == | ||
Revision as of 04:41, 22 June 2011
Oregon Department of Education knowledge and skills for Coding, Compression, and Crytography
D.11 Coding Theory, Compression and Cryptography: Understand coding of alphabets and simple encryption methods.
D.11.1 Use integer functions to encode alphabets and to create error-checking correcting codes.
D.11.2 Use permutations, combinations of digraph encoding and affine transformation and hash functions, to create encryption codes.
D.11.3 Demonstrate understanding of asymmetric public key cryptography algorithms such as RSA and Diffie-Hellman.
D.11.4 Demonstrate understanding of error-detecting and error-correcting codes and data compression through Huffman codes.
Discrete Math Learning modules
Introduction to coding theory (from Terrel Smith's class, MS-Powerpoint slide set)
Huffman encoding ppt, information links and sample java program
Resources for Coding, Compression and Cryptography
Information theory and compression introduction
How JPEG compression works
