Sudoku-like arrays, codes and orthogonality

DOI10.1007/s10623-016-0190-yzbMath1355.05064MaRDI QIDQ510424

Brett Stevens, David Thomson, Gary L. Mullen, Melissa Huggan

Publication date: 17 February 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0190-y

zbMATH Keywords

Latin squares; hypercubes; MDS codes; Sudoku; elementary intervals

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

05B15: Orthogonal arrays, Latin squares, Room squares

05B25: Combinatorial aspects of finite geometries

94B99: Theory of error-correcting codes and error-detecting codes

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Swan-like results for binomials and trinomials over finite fields of odd characteristic
• Sets of orthogonal hypercubes of class \(r\)
• Calculation of the discrepancy of a finite set of points in the unit \(n\) -cube
• Point sets with uniformity properties and orthogonal hypercubes
• Intersection of isomorphic linear codes
• Classical arcs in \(PG(r,q)\) for \(11\leq q\leq 19\)
• Classical arcs in PG\((r,q)\) for \(23\leq q\leq 29\)
• A simple approach to constructing quasi-Sudoku-based sliced space-filling designs
• Handbook of Finite Fields
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• Fundamentals of Error-Correcting Codes