群碼的最短距離 II

MUSTIR > College of Humanities, Social and Natural Sciences > The Teaching Center of Natural Science > Research Projects in School > Item 987654321/572

Please use this identifier to cite or link to this item: http://120.105.36.38/ir/handle/987654321/572

Title:	群碼的最短距離 II
Authors:	侯源安
Contributors:	人文社會科學院自然科學教學中心
Keywords:	群碼的最短距離 II
Date:	2010-12
Issue Date:	2011-06-22 09:41:41 (UTC+8)
Abstract:	本文將研究用秩為pq , p, q為質數,的交換群製造出的群碼.延續97 年本校校內計畫 “群碼的最短距離＂中所得之結果,本研究將證明適當的選擇體及一組內互相正交的idempotents F FG  , 可製造最短距離為 2  的群碼.本研究也設計一個求u 的方法,使所得之群碼是最佳的MDS-碼.
Appears in Collections:	[The Teaching Center of Natural Science] Research Projects in School

Files in This Item:

File	Description	Size	Format
89自然科學 -侯源安1.pdf		512Kb	Adobe PDF	641	View/Open