大葉大學圖書館 |

登入

回首頁

Intersection problem for the class o...

Auburn University.

Intersection problem for the class of quaternary Reed-Muller codes.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
書名/作者:	Intersection problem for the class of quaternary Reed-Muller codes.
作者:	Delgado Ortiz, Abel Ahbid Ahmed.
面頁冊數:	58 p.
附註:	Source: Dissertation Abstracts International, Volume: 70-12, Section: B, page: 7601.
Contained By:	Dissertation Abstracts International70-12B.
標題:	Mathematics.
標題:	Artificial Intelligence.
標題:	Computer Science.
ISBN:	9781109519983
摘要、提要註:	Given two codes C1 and C2 over an alphabet F, we denote the size of their intersection by eta( C1,C2 ), and call this the intersection number of C1 and C2 .
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3386192

Intersection problem for the class of quaternary Reed-Muller codes.
Delgado Ortiz, Abel Ahbid Ahmed.

Intersection problem for the class of quaternary Reed-Muller codes. - 58 p.

Source: Dissertation Abstracts International, Volume: 70-12, Section: B, page: 7601.

Thesis (Ph.D.)--Auburn University, 2009.

Given two codes C1 and C2 over an alphabet F, we denote the size of their intersection by eta( C1,C2 ), and call this the intersection number of C1 and C2 .

ISBN: 9781109519983Subjects--Topical Terms:

172349
Mathematics.

Intersection problem for the class of quaternary Reed-Muller codes.
LDR:01828nam 2200313 4500 001 344941
005 20100910124359.5
008 110817s2009 ||||||||||||||||| ||eng d
020 $a 9781109519983
035 $a (UMI)AAI3386192
035 $a AAI3386192
040 $a UMI $c UMI
100 1 $a Delgado Ortiz, Abel Ahbid Ahmed. $3 423267
245 1 0 $a Intersection problem for the class of quaternary Reed-Muller codes.
300 $a 58 p.
500 $a Source: Dissertation Abstracts International, Volume: 70-12, Section: B, page: 7601.
500 $a Adviser: Kevin T. Phelps.
502 $a Thesis (Ph.D.)--Auburn University, 2009.
520 $a Given two codes C1 and C2 over an alphabet F, we denote the size of their intersection by eta( C1,C2 ), and call this the intersection number of C1 and C2 .
520 $a In general the intersection problem can be stated as follows: given a family or class of families of codes, find the spectrum of intersection numbers. The general strategy to attack this kind of problem begins by finding necessary conditions for the intersection. This leads to lower and upper bounds or a set of possible intersection numbers. Secondly, finding the sufficient conditions implies giving specific constructions of codes in such a way that the cardinality of their intersection fits those values between these bounds.
520 $a In this dissertation is presented a complete solution of the intersection problem for QRM (r, m). This includes the well-known quaternary Kerdock code, the Kerdock-like code and Preparata-like code.
590 $a School code: 0012.
650 4 $a Mathematics. $3 172349
650 4 $a Artificial Intelligence. $3 423269
650 4 $a Computer Science. $3 423143
690 $a 0405
690 $a 0800
690 $a 0984
710 2 $a Auburn University. $3 423268
773 0 $t Dissertation Abstracts International $g 70-12B.
790 1 0 $a Phelps, Kevin T., $e advisor
790 $a 0012
791 $a Ph.D.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3386192

筆 0 讀者評論

多媒體

多媒體檔案
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3386192

評論

新增評論分享你的心得

Export

取書館別