2001Çг⵵ 1Çб⠴ëÇпø °ú¸ñ ¼Ò°³  -- Àü±âÀüÀÚ°øÇаú

Theory and Application of Finite Fields (À¯ÇÑü ÀÌ·Ð ¹× ÀÀ¿ë)

´ã´ç±³¼ö: ¼ÛÈ«¿±
hysong@yonsei.ac.kr            

Click   ¼ö¾÷ÀÏÁö for daily progress and announcement.

°ú¸ñ°³¿ä:

±³Àç:

¼ö¾÷¸ñÇ¥:

³»¿ë¿ä¾à:

ÁÖ

³» ¿ë ¿ä ¾à

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¹®Á¦¿Í Áß°£½ÃÇè, ±×¸®°í ±â¸»½ÃÇèÀ» ±âÃÊ·Î »êÁ¤.

 

Æò°¡¿øÄ¢: º» °ú¸ñÀº »ó´ëÆò°¡ ¿øÄ¢À» ÁؼöÇÕ´Ï´Ù.