This paper introduces almost partitionable sets (APSs) to generalize the known concept of partitionable sets. These notions provide a unified frame to construct (Formula presented.) -cyclic patterned starter whist tournaments and cyclic balanced sampling plans excluding contiguous units. The existences of partitionable sets and APSs are investigated. As an application, a large number of optical orthogonal codes achieving the Johnson bound or the Johnson bound minus one are constructed.
Partitionable sets, almost partitionable sets, and their applications
Costa S.;
2020-01-01
Abstract
This paper introduces almost partitionable sets (APSs) to generalize the known concept of partitionable sets. These notions provide a unified frame to construct (Formula presented.) -cyclic patterned starter whist tournaments and cyclic balanced sampling plans excluding contiguous units. The existences of partitionable sets and APSs are investigated. As an application, a large number of optical orthogonal codes achieving the Johnson bound or the Johnson bound minus one are constructed.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
ChangCostaFengWangPSandAPS.pdf
gestori archivio
Descrizione: Articolo principale
Tipologia:
Full Text
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
1.1 MB
Formato
Adobe PDF
|
1.1 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.