Sudoku-like arrays, codes and orthogonality

详细信息    查看全文

• 作者：M. Huggan ; G. L. Mullen ; B. Stevens ; D. Thomson
• 关键词：Elementary intervals ; Hypercubes ; Latin squares ; MDS codes ; Sudoku
• 刊名：Designs, Codes and Cryptography
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：82
• 期：3
• 页码：675-693
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Combinatorics; Coding and Information Theory; Data Structures, Cryptology and Information Theory; Data Encryption; Discrete Mathematics in Computer Science; Information and Communication, Circuits;
• 出版者：Springer US
• ISSN：1573-7586
• 卷排序：82

文摘

This paper is concerned with constructions and orthogonality of generalized Sudoku arrays of various forms. We characterize these arrays based on their constraints; for example Sudoku squares are characterized by having strip and sub-square constraints. First, we generalize Sudoku squares to be multi-dimensional arrays with strip and sub-cube constraints and construct mutually orthogonal sets of these arrays using linear polynomials. We add additional constraints motivated by elementary intervals for low discrepancy sequences and again give a construction of these arrays using linear polynomials in detail for 3 dimensional and a general construction method for arbitrary dimension. Then we give a different construction of these hypercubes due to MDS codes. We also analyze the orthogonality of all of the Sudoku-like hypercubes we consider in this paper.