2001Çг⵵ 1Çбâ
´ëÇпø °ú¸ñ ¼Ò°³ -- Àü±âÀüÀÚ°øÇаú
Theory and Application of Finite Fields (À¯ÇÑü ÀÌ·Ð
¹× ÀÀ¿ë)
´ã´ç±³¼ö: ¼ÛÈ«¿±
hysong@yonsei.ac.kr
Click ¼ö¾÷ÀÏÁö for daily progress and announcement.
°ú¸ñ°³¿ä:
º» °ú¸ñÀº Spread Spectrum Communication System°ú Error Correcting CodesÀÇ ±âÃÊ°ú¸ñÀÌ´Ù.
PN Code¿Í Error Correcting Code´Â ¹ÐÁ¢ÇÑ °ü°è°¡ ÀÖÀ¸¸ç À¯ÇÑü(Finite Field)ÀÇ ¿ø¼Ò·Î ±¸¼ºµÇ¹Ç·Î
À̵éÀ» ¼³°èÇÏ°í ºÐ¼®Çϱâ À§Çؼ À¯ÇÑü(Finite Field)¿¡ ´ëÇÑ ±âÃÊÀÌ·ÐÀ» È®¸³ÇÒ ÇÊ¿ä°¡ ÀÖ´Ù.
±³Àç:
[1] R. J. McEliece, Finite Fields for Computer Scientist and Engineers, KAP, 1987. -- ÁÖ±³Àç
[2] Lidl and Niedereiter, Finite Fields, Cambridge University Press, 1983. -- ºÎ±³Àç
[3] CRC Handbook of Combinatorial Mathematics, CRC Press, 1996. -- ºÎ±³Àç
¼ö¾÷¸ñÇ¥:
[1] ´ë¼öÇÐÀû ±¸Á¶¿Í À¯ÇÑü ±¸Á¶¿¡ ´ëÇÑ ÀÌÇØ
[2] ¿À·ùÁ¤Á¤ºÎÈ£ À̷п¡ ´ëÇÑ ÀÀ¿ë
[3] DS/FH CDMA Äڵ弳°è¿¡ ´ëÇÑ ÀÀ¿ë
[4] ¾ÏÈ£Çп¡ ´ëÇÑ ÀÀ¿ë
³»¿ë¿ä¾à:
ÁÖ |
³» ¿ë ¿ä ¾à |
HW |
Á¦1ÁÖ |
Introduction |
|
Á¦2ÁÖ |
Groups, Rings, Fields, Vector Spaces |
HW#1 |
Á¦3ÁÖ |
Galois Field - introduction |
|
Á¦4ÁÖ |
Additive and Multiplicative Structure |
HW#2 |
Á¦5ÁÖ |
Irreducible and Primitive Polynomials |
HW#3 |
Á¦6ÁÖ |
Trace functions |
|
Á¦7ÁÖ |
Bit Serial Multiplication |
HW#4 |
Á¦8ÁÖ |
midterm exam (mainly on HWs) |
|
Á¦9ÁÖ |
Linear Recurring Sequences and m-sequences |
|
Á¦10ÁÖ |
Randomness Property of m-sequences |
|
Á¦11ÁÖ |
Application to Code Design for CDMA |
HW#5 |
Á¦12ÁÖ |
Application to Error Correcting Codes |
|
Á¦13ÁÖ |
Application to Code Design for FH-SSMA |
|
Á¦14ÁÖ |
Cyclic Difference Sets and m-sequences |
HW#6 |
Á¦15ÁÖ |
Application to Cryptographic Algorithms |
|
Á¦16ÁÖ |
final exam (on Seven topics after midterm) |
|
¼ºÀû: 6ȸÀÇ HW¹®Á¦¿Í Áß°£½ÃÇè, ±×¸®°í ±â¸»½ÃÇèÀ» ±âÃÊ·Î »êÁ¤.
¼ºÀûÆò°¡ÀÇ ±âÃÊ |
Á¡¼ö |
Ãâ¼® ¹× ¼ö¾÷ŵµ |
20Á¡ |
HW |
30 x 6 = 180Á¡ |
Áß°£½ÃÇè |
200 Á¡ |
±â¸»½ÃÇè |
200 Á¡ |
ÃÑÁ¡ |
600 Á¡ |
Æò°¡¿øÄ¢: º» °ú¸ñÀº »ó´ëÆò°¡ ¿øÄ¢À» ÁؼöÇÕ´Ï´Ù.
µî±Þ |
ºñÀ² |
Aµî±Þ(A+, Ao, A-) |
40 % |
Bµî±Þ(B+, Bo, B-) |
50 % |
Cµî±Þ(C+, Co, C-) |
0 - 10 % |
Fµî±Þ |
0 - 10 % |