D.11: Coding Theory, Compression and Cryptography
From
Poul.murtha (Talk | contribs) |
(→Resources for Coding, Compression and Cryptography) |
||
| (9 intermediate revisions not shown) | |||
| Line 1: | Line 1: | ||
| - | == | + | == Oregon Department of Education knowledge and skills for Coding, Compression, and Crytography == |
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||
'''D.11 Coding Theory, Compression and Cryptography:''' Understand coding of | '''D.11 Coding Theory, Compression and Cryptography:''' Understand coding of | ||
alphabets and simple encryption methods. | alphabets and simple encryption methods. | ||
| Line 18: | Line 14: | ||
D.11.4 Demonstrate understanding of error-detecting and error-correcting codes and | D.11.4 Demonstrate understanding of error-detecting and error-correcting codes and | ||
data compression through Huffman codes. | data compression through Huffman codes. | ||
| + | <br/><br/> | ||
| + | |||
| + | == Discrete Math Learning modules == | ||
| + | [[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 == | ||
| + | [http://http://www.data-compression.com/lossless.html Information theory and compression introduction]<br/> | ||
| + | [http://http://www.ams.org/samplings/feature-column/fcarc-image-compression How JPEG compression works]<br/> | ||
| + | [http://www.di-mgt.com.au/rsa_alg.html Math behind the RSA encryption algorithm (public key cryptography)] | ||
| + | <br/><br/> | ||
| + | ---- | ||
| + | {{HS Discrete Math (CS0)/ChapNav}} | ||
| + | ---- | ||
| + | [[Category:HS Discrete Math (CS0)|{{SUBPAGENAME}}]] | ||
Current revision as of 23:55, 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
Math behind the RSA encryption algorithm (public key cryptography)
