(A) decoding algorithm for the 1st order reed-muller codes and orthogonal latin square codes1차 리드-뮬러 코드와 직교 라틴방진의 해독법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 817
  • Download : 0
In this thesis, we give simple and useful decoding algorithm of two linear codes. In Chapter 1, we introduce the basic notions about coding theory and explain some properties of linear code. Particularly the syndrome plays an important role to decode an orthogonal Latin square codes. In Chapter 2, we review the well known properties of the 1st order Reed-Muller codes R(1,m) and introduce the concepts of mass, mass distance, and pattern to give a mass-decoding method for this code. Finally we propose a new mass-decoding method for R(1,m). This method is based on the form for Hadamard code of order $n=2^m$ and provides an easy decoding which can be done manually In Chapter 3, we recall the well-known definitions concerning Latin squares and summarize a construction of (p-1) mutually orthogonal Latin squares when p is an odd prime. In $L_p$, we need to find the first and the second coordinates of codeword in order to correct the errored received vector. Finally we give a decoding algorithm which is based on the syndrome decoding for linear codes.
Advisors
Hahn, Sang-Geunresearcher한상근researcher
Description
한국과학기술원 : 수학과,
Publisher
한국과학기술원
Issue Date
1997
Identifier
128592/325007 / 000925040
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 수학과, 1997.8, [ [ii], [35] p. ; ]

Keywords

하다마드행렬; Syndrome; MDS code; Latin square; Hadamard matrix; Reed-Muller code; 신드롬; 리드-뮬러코드; 라틴방진; MDS코드

URI
http://hdl.handle.net/10203/41796
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=128592&flag=dissertation
Appears in Collection
MA-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0