English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Optical orthogonal signature pattern codes (OOSPCs) play an important role ina novel type of optical code-division multiple-access (CDMA) network for2-dimensional image transmission. There is a one-to-one correspondence betweenan $(m, n, w, \lambda)$-OOSPC and a $(\lambda+1)$-$(mn,w,1)$ packing designadmitting an automorphism group isomorphic to $\mathbb{Z}_m\times\mathbb{Z}_n$. In 2010, Sawa gave the first infinite class of $(m, n, 4,2)$-OOSPCs by using $S$-cyclic Steiner quadruple systems. In this paper, we usevarious combinatorial designs such as strictly $\mathbb{Z}_m\times\mathbb{Z}_n$-invariant $s$-fan designs, strictly $\mathbb{Z}_m\times\mathbb{Z}_n$-invariant $G$-designs and rotational Steiner quadruple systems topresent some constructions for $(m, n, 4, 2)$-OOSPCs. As a consequence, our newconstructions yield more infinite families of optimal $(m, n, 4, 2)$-OOSPCs.Especially, we shall see that in some cases an optimal $(m, n, 4, 2)$-OOSPC cannot achieve the Johnson bound.

Combinatorial Constructions of Optimal $(m, n,4,2)$ Optical Orthogonal Signature Pattern Codes