Difference covering arrays and pseudo-orthogonal Latin squares

DOI10.1007/s00373-015-1649-8zbMath1343.05041arXiv1502.02332OpenAlexW1596501089MaRDI QIDQ2631078

Fatih Demirkale, A. Baliga, Abdollah Khodkar, Diane M. Donovan, Joanne L. Hall

Publication date: 28 July 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.02332

zbMATH Keywords

Latin squaresdifference covering arraymutually nearly orthogonal Latin squarespseudo-orthogonal Latin squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (3)

Covering schemes of strength \(t\) ⋮ The spectrum of semicyclic holey group divisible designs with block size three ⋮ High-rate LDPC codes from partially balanced incomplete block designs

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial characterizations of authentication codes
• Orthogonal arrays. Theory and applications
• Constructions of difference covering arrays.
• Cyclic difference packing and covering arrays.
• On (\(g\), 4; 1)-difference matrices
• Incidence matrices and inequalities for combinatorial designs
• Compressing inconsistent data
• Direct Constructions for General Families of Cyclic Mutually Nearly Orthogonal Latin Squares

This page was built for publication: Difference covering arrays and pseudo-orthogonal Latin squares