#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2013

2017

- This year (3)
- Last 5 years (11)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this article, we will present the work carried out in various projects in the context of the development of a… (More)

- Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala
- IEEE Transactions on Information Theory
- 2016

Most bounds on the size of codes hold for any code, whether linear or not. Notably, the Griesmer bound holds only in the linear case and so optimal linear codes are not necessarily optimal codes. In this paper, we identify code parameters (q, d, k), namely, field size, minimum distance, and combinatorial dimension, for which the Griesmer bound also holds in… (More)

- Alessandro Tomasi, Alessio Meneghetti, Massimiliano Sala
- ArXiv
- 2015

- Nicola Massari, Leonardo Gasparini, +5 authors David Stoppa
- ISSCC
- 2016

- Alessandro Tomasi, Alessio Meneghetti, Massimiliano Sala
- Finite Fields and Their Applications
- 2017

We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connection between the Walsh spectrum of the resulting random variable and the weight distribution of the code. Previously known bounds on the performance of linear binary codes as… (More)

- Alessio Meneghetti, Massimiliano Sala, Alessandro Tomasi
- ArXiv
- 2014

We consider a bound on the bias reduction of a random number generator by processing based on binary linear codes. We introduce a new bound on the total variation distance of the processed output based on the weight distribution of the code generated by the chosen binary matrix. Starting from this result we show a lower bound for the entropy rate of the… (More)

- Alessio Meneghetti, Giulia Boato, Francesco G. B. De Natale
- Image Processing: Algorithms and Systems
- 2013

The last few years have seen a massive increment in the use of the Internet as a channel for sharing and transmitting data, thus requiring the need for copyright protection schemes able to preserve the ownership of the data. The idea of embedding a watermark directly in the data is however unacceptable in various fields of application, due to the intrinsic… (More)

Most bounds on the size of codes hold for any code, whether linear or nonlinear. Notably, the Griesmer bound, holds only in the linear case. In this paper we characterize a family of systematic nonlinear codes for which the Griesmer bound holds. Moreover, we show that the Griesmer bound does not necessarily hold for a systematic code by showing explicit… (More)

- Mathilde Soucarros, Samuel Burri, +7 authors Damien Stucki
- 2013

Random numbers are a fundamental building block for a number of applications such as cryptography, numerical simulations or the gaming industry. There are two types of random number generator: pseudo-random number generators and true random number generators. The first type is implemented to be deterministic: a specific input seed will always generate the… (More)