#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2008

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Marco Buratti, Anita Pasotti
- Des. Codes Cryptography
- 2010

- Marco Buratti, Koji Momihara, Anita Pasotti
- Des. Codes Cryptography
- 2011

- Marco Buratti, Anita Pasotti
- Finite Fields and Their Applications
- 2009

- Anita Pasotti
- Discrete Mathematics
- 2010

- Marco Buratti, Anita Pasotti, Dianhua Wu
- Des. Codes Cryptography
- 2013

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)

- Anita Pasotti, Marco Antonio Pellegrini
- Discrete Mathematics
- 2014

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)

- Anita Pasotti, Marco Antonio Pellegrini
- Electr. J. Comb.
- 2014

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)

- Anita Pasotti
- Ars Comb.
- 2013

We introduce a generalization of the well known concept of a graceful labeling. Given a graph Γ with e = d · m edges, we call d-graceful labeling of Γ an injective function from(m + 1)}. In the case of d = 1 and of d = e we find the classical notion of a graceful labeling and of an odd graceful labeling, respectively. Also, we call d-graceful α-labeling of… (More)

- Luca Giuzzi, Anita Pasotti
- Discrete Mathematics
- 2012

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)

- A. Pasotti
- 2010

Let Γ be a subgraph of a graph Γ. We define a down-link from a (K v , Γ)-design B to a (K n , Γ)-design B as an injective map f : B → B mapping any block of B into one of its subgraphs. This is a new concept, closely related with both the classical notion of embedding and the more recent one of sampling. In the present paper we study down-links in general… (More)