º» °ú¸ñÀº ¿µ¾î·Î °ÀÇ°¡ ÁøÇàµË´Ï´Ù.
´ã´ç±³¼ö: ¼ÛÈ«¿± hy.song@coding.yonsei.ac.kr 2123-4861 http://coding.yonsei.ac.kr/~hysong B612-613
´ã´çÁ¶±³: Áø¼®¿ë (ºÎÈ£¹×Á¤º¸ÀÌ·Ð ¿¬±¸½Ç ¹Ú»ç°úÁ¤ 4Çбâ) B612-613
¼ö¾÷½Ã°£: ÁÖ´ç 1.5½Ã°£¾¿ 2ȸ °ÀǼö¾÷ = ÃÑ 3½Ã°£/ÁÖ (ȸñ 5-6±³½Ã, 1½Ã10ºÐ-2½Ã50ºÐ, 100ºÐ¼ö¾÷ 2ȸ)
´ë»ó:
´ëÇпø
Àü±âÀüÀÚ°øÇаú ¼®»ç°úÁ¤/¹Ú»ç°úÁ¤. Åë½ÅºÐ¾ß/½Åȣ󸮺оß/³×Æ®¿öÅ©ºÐ¾ß
ÇкΠÀü±âÀüÀÚ°øÇÐÀü°ø. Åë½ÅºÐ¾ßÀÇ
½ÅÈ£¼³°è ȤÀº ä³ÎÄÚµùÀ̷п¡ °ü½ÉÀÖ´Â 3.4ÇгâÀÇ ¼ö°À» ȯ¿µÇÔ.
°ú¸ñ¼Ò°³:
Çö´ë´ë¼öÇÐ/¼±Çü´ë¼öÇÐ/ÀÌ»ê¼öÇÐÀÇ
±âÃʸ¦ ¼Ò°³ÇÏ°í À¯ÇÑü ÀÌ·Ð ¹× ÀÀ¿ë(¿À·ùÁ¤Á¤ºÎÈ£/¾ÏÈ£ÀÌ·Ð µîµî)À» °øºÎÇÑ´Ù.
ÀÀ¿ëÀÌ»ê¼öÇÐÀÇ
ÇÑ Áٱ⸦ µû¶ó¼ ¼öÇÐÀû ÀÌ·ÐÀÌ °øÇÐÀû ¹®Á¦ÇØ°á¿¡ ³¢Ä¡´Â ¿µÇâÀ» °øºÎÇÑ´Ù.
DS/FH- CDMA ÄÚµå
¼³°è¿Í
¿À·ùÁ¤Á¤ºÎÈ£ÀÇ ±âº»ÀÌ µÇ´Â ³»¿ëÀÌ´Ù.
±³Àç: Norman L. Biggs, Discrete Mathematics, revised edition, Oxford Science Publications, 1998.
Objective |
¢º Elementary Number Theory ¢º Important Concepts in Modern Algebra/Linear Algebra/Counting ¢º Finite Fields ¢º BCH and RS Codes, RSA/ElGamal Cryptography |
||
Text |
¢º Discrete Mathematics by Biggs ¢º Finite Fields for Computer Scientists and Engineers by McEleice ¢º Some Lecture Notes |
||
Week |
Summary |
Remark |
Homework |
1 |
Integers and Congruence |
|
HW#1 |
2 |
Groups and Permutations |
|
HW#2 |
3 |
Simultaneous Equations and Vector Spaces |
|
HW#3 |
4 |
Matrix/Determinants/Linear Transformations |
|
HW#4 |
5 |
Some Concepts in Modern Algebra - Homomorphisms |
|
HW#5 |
6 |
Burnside and Polya Theory of Counting I |
|
HW#6 |
7 |
Burnside and Polya Theory of Counting II |
|
|
8 |
Midterm Exam |
|
|
9 |
Construction of Finite Fields using Irreducible Polynomials |
|
HW#7 |
10 |
Abstract Properties of Finite Fields - Additive Structure |
|
HW#8 |
11 |
Abstract Properties of Finte Fields - Multiplicative Structure |
|
HW#9 |
12 |
BCH Codes - Encoding/Decoding |
|
HW#10 |
13 |
Finite Field Fourier Transform |
|
HW#11 |
14 |
Reed-Solomon Codes - Encoding/Decoding Algorithms |
|
HW#12 |
15 |
RSA/ElGamal Encryption/Authentication Algorithms |
|
|
16 |
Final Exam |
|
|
Æò°¡¹æ¹ý:
±âŸ»çÇ×: