臺灣博碩士論文加值系統

本篇論文提供了一個特定的群可分設計中區塊大小分別為3，4，5 及6 的建構方式。此研究為二元平方剩餘碼解碼器之開發的附加結果。最後，我們將結論整理成圖表，並經由觀察提出對於相同群可分設計，但區塊大小更大的猜想。

This thesis gives a construction of group divisible designs with block sizes 3; 4; 5 and 6 respectively. This work is motivated from the decoding of binary quadratic residue codes. Furthermore, we present these results in a table and propose a conjecture for this construction of group divisible designs with larger block sizes.

Abstract (in Chinese) i
Abstract (in English) ii
Acknowledgement iii
Table of Contents iv
1 Introduction 1
2 Preliminary 3
3 Theorem and proof 6
4 Conclusion remark 20
Bibliography 22

[1] I. Anderon, Combinatorial Designs: Construction Methods, Ellis Horwood, 1990.
[2] Y. Chang, T.K. Truong, I.S. Reed, H.Y. Cheng and C.D. Lee, Algebraic decoding of (71; 36; 11); (79; 40; 15); and (97; 49; 15) quadratic residue codes, IEEE Trans. on Communications, 51 (2003), 1463-1473.
[3] H.L. Fu and C.A. Rodger, Group divisible designs with two associate classes: n = 2 or m = 2; J. Combin. Theory Ser. A 83 (1998) 94-117.
[4] V. Pless, Introduction to the Theory of Error-Correction Codes 3rd ed., John Wiley & Sons Inc., 1998.
[5] D.G. Sarvate and J. Seberry, Group divisible designs, GBRSDS, and generalized weighing matrices, Utilitas Mathematica 54 (1998) 157-174.
[6] Z.X. Wan, Design Theory, Higher Education, 2009.
[7] Z.X. Wan, Finite Field and Galois Rings, World Scienti c, 2012.