Resolvable generalized difference matrices: existence and applications

DOI10.1016/J.FFA.2016.06.008MaRDI QIDQ324263zbMATHOpenAlexFDO

Authors Jie Yan, Jianxing Yin, Chengmin Wang

Publication date 10 October 2016

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ffa.2016.06.008

zbMATH Keywords

compatibilitycyclic difference packingsgeneralized difference matricesorbit-disjointresolvable generalized difference matrices

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• Concerning difference matrices
• Construction of generalized Hadamard matrices \(D(r^m(r+1),r^m(r+1);p)\)
• scientific article; zbMATH DE number 3933094
• Orthogonal arrays obtained by generalized difference matrices with \(g\) levels
• On difference matrices, transversal designs, resolvable transversal designs and large sets of mutually orthogonal F-squares

Cites work

• scientific article; zbMATH DE number 1229693 (Why is no real title available?)
• scientific article; zbMATH DE number 3807618 (Why is no real title available?)
• scientific article; zbMATH DE number 3252237 (Why is no real title available?)
• A general construction for optimal cyclic packing designs
• A note on difference matrices over non-cyclic finite abelian groups
• Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$
• Constructions for Steiner quadruple systems with a spanning block design
• Constructions of external difference families and disjoint difference families
• Constructions of strictly \(m\)-cyclic and semi-cyclic \(H(m,n,4,3)\)
• Cyclic designs with block size 4 and related optimal optical orthogonal codes
• Cyclic difference packing and covering arrays.
• Further progress on difference families with block size 4 or 5
• Generalized Bhaskar Rao designs with block size 3 over finite abelian groups
• Multilength Optical Orthogonal Codes: New Upper Bounds and Optimal Constructions
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• On (\(g\), 4; 1)-difference matrices
• On difference schemes and orthogonal arrays of strength \(t\)
• On orthogonal orthomorphisms of cyclic and non-Abelian groups
• On the Problem of Construction of Orthogonal Arrays
• Optimal \((9v,4,1)\) optical orthogonal codes
• Orbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCs
• Orthogonal Arrays of Index Unity
• Orthogonal Arrays of Strength two and three
• Orthogonal arrays. Theory and applications
• Semicyclic 4-GDDs and related two-dimensional optical orthogonal codes
• Some 20-regular CDP(5,1;20\(u\)) and their applications
• Some combinatorial constructions for optical orthogonal codes
• Some progress on \((v,4,1)\) difference families and optical orthogonal codes
• Some series of optimal multilength OOCs of weight four
• The CRC handbook of combinatorial designs
• Two-Dimensional Optical Orthogonal Codes and Semicyclic Group Divisible Designs

Cited in

(4)

• Construction of orthogonal arrays of strength three by augmented difference schemes
• A construction of variable strength covering arrays
• Compatible difference packing set systems and their applications to multilength variable-weight OOCs
• Difference schemes of strength \(t\) over finite commutative rings

This page was built for publication: Resolvable generalized difference matrices: existence and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324263)