Cyclic difference packing and covering arrays.
From MaRDI portal
Publication:2572992
DOI10.1007/s10623-004-3991-3zbMath1136.05304MaRDI QIDQ2572992
Publication date: 7 November 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-004-3991-3
05B15: Orthogonal arrays, Latin squares, Room squares
Cites Work
- Difference packing arrays and systematic authentication codes
- On the existence of MOLS with equal-sized holes
- Existence of three HMOLS of types \(h^ n\) and \(2^ n3^ 1\)
- Lower bounds for transversal covers
- Direct constructions for certain types of HMOLS
- Constructions of difference covering arrays.
- Some combinatorial constructions for optical orthogonal codes
- A general construction for optimal cyclic packing designs
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Constructions for optimal optical orthogonal codes
- Partial λ-Geometries and Generalized Hadamard Matrices Over Groups
- Constructions for optimal (υ, 4, 1) optical orthogonal codes
- Combinatorial constructions of optimal optical orthogonal codes with weight 4