D.11: Coding Theory, Compression and Cryptography
From
(Difference between revisions)
Poul.murtha (Talk | contribs) |
m (→Discrete Math Learning modules) |
||
| Line 18: | Line 18: | ||
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/> | ||
| + | ---- | ||
| + | {{HS Discrete Math (CS0)/ChapNav}} | ||
| + | ---- | ||
| + | [[Category:HS Discrete Math (CS0)|{{SUBPAGENAME}}]] | ||
Revision as of 07:43, 2 August 2010
Discrete Math Learning modules
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.
