View : 19 Download: 0

Cyclic Hamming codes of redundancy r

Title
Cyclic Hamming codes of redundancy r
Authors
Lee, Juhyun
Issue Date
2005
Department/Major
대학원 수학과
Publisher
이화여자대학교 대학원
Degree
Master
Advisors
우성식
Abstract
The representation of a cyclic code by zeros of generator polynomials can be used to show that some Hamming codes are cyclic codes. The binary [2^(r)-1, 2^(r)-r-1]Hamming codes are equivalent to cyclic codes. In this thesis, we study the Hamming code in general and then consider a cyclic Hamming code of redundancy r with length (q^(r)-1)/(q-1) over \mathbb(F)_(q).;Generator polynomials의 zeros에 의한 cyclic code의 표현은 어떤 Hamming codes가 cyclic codes가 되는 것을 증명하기 위해 사용 되어질 수 있다. Binary Hamming codes는 cyclic codes에 equivalent하다. 이 논문에서는 일반적인 Hamming code를 공부하고 redundancy r의 cyclic Hamming code와 그에 따른 예를 전반적으로 고려한다.
Fulltext
Show the fulltext
Appears in Collections:
일반대학원 > 수학과 > Theses_Master
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE