#### Filter Results:

#### Publication Year

2009

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The size of a (v, 5, 2, 1) optical orthogonal code (OOC) is shown to be at most equal to v 12 when v ≡ 11 (mod 132) or v ≡ 154 (mod 924), and at most equal to v 12 in all the other cases. Thus a (v, 5, 2, 1)-OOC is naturally said to be optimal when its size reaches the above bound. Many direct and recursive constructions for infinite classes of optimal (v,… (More)

We report in the following tables a linear realization of some lists L = {1 a , 2 b , 3 c , 5 d } used by the authors to prove the results of [1], omitted there for sake of brevity. We order the lists according to the Lemmas/Propositions/Theorems in which they are used. In the second column of the following tables, we write P if the corresponding linear… (More)

In this paper we investigate a problem proposed by Marco Buratti, Peter Horak and Alex Rosa (denoted by BHR-problem) concerning Hamiltonian paths in the complete graph with prescribed edge-lengths. In particular we solve BHR({1 a , 2 b , t c }) for any even integer t 4, provided that a+b t−1. Furthermore, for t = 4, 6, 8 we present a complete solution of… (More)

Suppose Γ to be of a subgraph of a graph Γ. We define a sampling of a Γ-design B = (V, B) into a Γ-design B = (V, B) as a surjective map ξ : B → B mapping any block of B into one of its subgraphs. A sampling will be called regular when the number of preimages of any block of B under ξ is a constant. This new concept is closely related with the classical… (More)