Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 우성식 | - |
dc.contributor.author | Lee, Juhyun | - |
dc.creator | Lee, Juhyun | - |
dc.date.accessioned | 2016-08-25T04:08:32Z | - |
dc.date.available | 2016-08-25T04:08:32Z | - |
dc.date.issued | 2005 | - |
dc.identifier.other | OAK-000000010882 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/178612 | - |
dc.identifier.uri | http://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000010882 | - |
dc.description.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와 그에 따른 예를 전반적으로 고려한다. | - |
dc.description.tableofcontents | CONTENTS 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.format | application/pdf | - |
dc.format.extent | 374553 bytes | - |
dc.language | eng | - |
dc.publisher | 이화여자대학교 대학원 | - |
dc.title | Cyclic Hamming codes of redundancy r | - |
dc.type | Master's Thesis | - |
dc.creator.othername | 이주현 | - |
dc.format.page | ii, 41 p. | - |
dc.identifier.thesisdegree | Master | - |
dc.identifier.major | 대학원 수학과 | - |
dc.date.awarded | 2005. 8 | - |