View : 126 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.advisor우성식-
dc.contributor.authorLee, Juhyun-
dc.creatorLee, Juhyun-
dc.date.accessioned2017-08-28T10:01:08Z-
dc.date.available2017-08-28T10:01:08Z-
dc.date.issued2005-
dc.identifier.otherOAK-000000010882-
dc.identifier.urihttp://dspace.ewha.ac.kr/handle/2015.oak/178612-
dc.identifier.urihttp://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000010882-
dc.description.abstractThe 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와 그에 따른 예를 전반적으로 고려한다.-
dc.description.tableofcontentsCONTENTS ABSTRACT = ⅱ 1 Introduction = 1 2 Preliminaries = 3 2.1 Linear codes = 3 2.2 Cyclic codes = 11 3 Cyclic Hamming codes of redundancy r = 15 4 Example = 33 References = 40-
dc.formatapplication/pdf-
dc.format.extent374553 bytes-
dc.languageeng-
dc.publisher이화여자대학교 대학원-
dc.titleCyclic Hamming codes of redundancy r-
dc.typeMaster's Thesis-
dc.creator.othername이주현-
dc.format.pageii, 41 p.-
dc.identifier.thesisdegreeMaster-
dc.identifier.major대학원 수학과-
dc.date.awarded2005. 8-
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