Dissertation > Excellent graduate degree dissertation topics show

Association Schemes Obtained from a Class of Orthogonal Arrays by Deleting Some Columns

Author: ChengXinRu
Tutor: PangShanQi
School: Henan Normal
Course: Probability Theory and Mathematical Statistics
Keywords: Diference matrix association scheme schematic orthogonal arrays Ham-ming distance
CLC: O212.6
Type: Master's thesis
Year: 2013
Downloads: 22
Quote: 0
Read: Download Dissertation

Abstract


Association scheme is a part of what is now called algebraic combinatorics, which was defined by R.C. Bose and T.Shimamoto in1952, it is a combinatorics structure in balance incomplete block designs and it describes the balance of symbols with many associate relations. With the further study of association scheme, it was found to have close relations with group, coding theory, graph theory and combinatorics. The study of association scheme has developed into an important branch of algebraic combinatorics. Especially it provides a theoretical framework for the coding theory, so the study of association scheme has developed into an important branch of algebraic combinatorics.In the theory of orthogonal arrays, an orthogonal array is called schematic if its rows form an association scheme with respect to Hamming distances. A.S. Hedayat studied the orthogonal arrays in detail and proposed many open problems in 《Orthogonal Arrys:Theory and Application》. One of these problems is that in which orthogonal arrays the rows form an association scheme according to Hamming distances and how to classify them. At present, it is very few about the results of orthogonal arrays of association scheme. However, there are very few researches on the orthogonal arrays of strength2. In this paper we study the Hamming distances of the rows in orthogonal arrays and give the schematic orthogonal arrays with strength2and the construction of association schemes.Chapter1introduces the development and the current research status of orthogonal arrays and association scheme, and contains basic concepts and main lemmas.Chapter2extends the definitions of Hamming distance and schematic orthogonal array to allow the columns to have different levels, we then study the Hamming distances of the rows in a class of orthogonal arrays obtained by deleting one or two columns from orthogonal arrays which are related with a class of difference matrix. A general construction method of association schemes according to the distances is presented and some of the orthogonal arrays are proved to be schematic. Some association schemes and schematic orthogonal arrays are provided to illustrate the applications of the method. Chapter3concludes the main content of this paper and puts forward some suggestionsand a few unsolved problems.

Related Dissertations

  1. The Research and Implementation of Iris Recognition Algorithm,TP391.41
  2. Multiple ASSociation Scheme in Wireless Mesh Networks,TN929.5
  3. Based on the weighted Hamming distance flatness pattern recognition method its application in engineering,TG339
  4. The Effects of Inbreeding in Species Evolution,Q14
  5. Hamming Distance and Lee Distance of Linear Negacyclic and Cyclic Codes over Z2α,O157.4
  6. Technical Documents Classification and Finding Repetition,G275.3
  7. The Personal Recognition Algorithm Study Based on Iris,TP391.41
  8. Based on the study of the iris identification system,TP391.4
  9. Staggered finite ring Z_ ( pq ) solution, the combination of the matrix,O153.3
  10. Study on the Model and Application of Comprehensive Post Evaluation for the Project of Reconstruction of the Electric Energy Metering Device,F224
  11. Iris Recognition Method and Its Implementation Based on k-NN Classification Matching,TP391.4
  12. The Damage Spreading Model Base on Bak-sneppen Model,Q11
  13. Can construct error-correcting d-disjunct matrix,O151.21
  14. Constructing association scheme using finite local ring Alternate Matrices,O153.3
  15. Constructing Disjunct (Separable) Matrices and Studying the Properties,O151.21
  16. The Research and Implementation of Immunology-Based Intrusion Detection System,TP393.08
  17. Inverse Optimization Problems under Hamming Distance and Multicommodity Production and Distribution Problems,O157
  18. Cartesian Authentication Codes Obtained by Orthogonal Array and Difference Matrix,O212.6
  19. Mutually Orthogonal Frequency Squares Obtained from Orthogonal Arrays,O212.6
  20. Optimization of DNA Coding Based on Ant Colony Optimization Algorithm,TP301.6
  21. An Alignment Algorithm for DNA Short Reads Based on the Hamming Distance,Q523

CLC: > Mathematical sciences and chemical > Mathematics > Probability Theory and Mathematical Statistics > Mathematical Statistics > Test analysis and experimental design
© 2012 www.DissertationTopic.Net  Mobile