南開科技大學圖書館 |

Language: 繁體中文

說明(常見問題)

南開科技大學

圖書館首頁

編目中圖書申請

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Topics in coding theory and combinat...

Michigan Technological University.

Topics in coding theory and combinatorial structures.

紀錄類型:	書目-電子資源 : 單行本
正題名/作者:	Topics in coding theory and combinatorial structures./
作者:	Sarami, Chekad.
面頁冊數:	112 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1359.
Contained By:	Dissertation Abstracts International65-03B.
標題:	Mathematics. -
電子資源:	Download fulltext (下載全文)
ISBN:	049673573X

Topics in coding theory and combinatorial structures.
Sarami, Chekad.

Topics in coding theory and combinatorial structures. - 112 p.

Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1359.

Thesis (Ph.D.)--Michigan Technological University, 2004.

In this dissertation we study some problems in the theory of error-correcting codes and combinatorics.

ISBN: 049673573XSubjects--Topical Terms:

146772
Mathematics.

Topics in coding theory and combinatorial structures.
LDR:03432nmm 2200325 4500 001 1000004267
005 20051102155240.5
008 141201s2004 eng d
020 $a 049673573X
035 $a (UnM)AAI3126287
035 $a AAI3126287
040 $a UnM $c UnM{me_controlnum}
100 1 $a Sarami, Chekad. $3 1000005556
245 1 0 $a Topics in coding theory and combinatorial structures.
300 $a 112 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1359.
500 $a Adviser: Vladimir D. Tonchev.
502 $a Thesis (Ph.D.)--Michigan Technological University, 2004.
520 $a In this dissertation we study some problems in the theory of error-correcting codes and combinatorics.
520 $a In the first Chapter we introduce some facts from elementary number theory, abstract algebra, Galois theory and algebraic structures, including: groups, permutation groups, finite fields, characters of Abelian groups, and polynomials, that will be used in later chapters. Additionally, there is brief overview of combinatorial theory, such as: designs, finite geometry, and the theory of error-correcting codes that we need for our work.
520 $a In Chapter 2, we give an algorithm for generating cyclic self-orthogonal codes; the number of cyclic self-orthogonal and maximal cyclic self-orthogonal q-ary of length n, for an arbitrary positive integer n with gcd(n, q) = 1 has been determined. A dimension formula for cyclic self-orthogonal q-ary codes of length qn - 1 with maximal dimension has been given. In Section 2.4, a mass formula and a classification algorithm for cyclic self-orthogonal q-ary codes of length n with maximal dimension is given. In Section 2.5 we classify cyclic self-orthogonal codes with maximum dimension.
520 $a In the Chapter 3, we deal with quasi-symmetric designs. The main result of this chapter is that every cyclic quasi-symmetric 2-(63, 15, 35) design with intersection numbers x = 3 and y = 7 is isomorphic to the quasi-symmetric 2-(63, 15, 35) design defined by the 3-dimensional subspaces in PG(5, 2). The method applied in the chapter can be used to generate and classify other cyclic self-orthogonal designs.
520 $a In chapter 4, we give an algorithm to list and classify generalized Hadamard matrices of a given order over an arbitrary elementary Abelian group. Generalized Hadamard matrices of order ≤12 over Abelian groups Z3,Z4 ,Z2x Z2 , and Z5 have been classified up to equivalence. We have shown that generalized Hadamard matrices of order 4, 8, and 12 over EA(4) are unique up to equivalence. We have computed the Kronecker sum of unique matrices of order 4, 8 and 12 by 226 inequivalent generalized Hadamard matrices of order 16. We have shown that the resulting matrices yield single error-detecting or single error-correcting codes.
520 $a In the last Chapter 4, we introduce some open problems related to previous chapters. All computations described in this document have been implemented using Magma or Mathematica. The source codes of these aforementioned computations can be found in the appendices.
590 $a School code: 0129.
650 4 $a Mathematics. $3 146772
690 $a 0405
710 2 0 $a Michigan Technological University. $3 1000005557
773 0 $t Dissertation Abstracts International $g 65-03B.
790 1 0 $a Tonchev, Vladimir D., $e advisor
790 $a 0129
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3126287 $z Download fulltext (下載全文)