Laura Luzzi

Assistant professor at ENSEA.

Scholarly works

Accepted
1. G. Cervia, L. Luzzi, M. Le Treust, and M. Bloch, “Strong Coordination of Signals and Actions over Noisy Channels with two-sided State Information.” accepted to IEEE Transactions on Information Theory, Feb. 2020.

We consider a network of two nodes separated by a noisy channel with two-sided state information, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme and develop inner and outer bounds for the strong coordination region. While the inner and outer bounds do not match in general, we provide a complete characterization of the strong coordination region in three particular cases: i) when the channel is perfect; ii) when the decoder is lossless; and iii) when the random variables of the channel are independent from the random variables of the source. Through the study of these special cases, we prove that the separation principle does not hold for joint source-channel strong coordination. Finally, in the absence of state information, we show that polar codes achieve the best known inner bound for the strong coordination region, which therefore offers a constructive alternative to random binning and coding proofs.

@misc{Cervia2018,
author = {Cervia, Giulia and Luzzi, Laura and {Le Treust}, Ma\"el and Bloch, Matthieu},
howpublished = {accepted to \emph{IEEE Transactions on Information Theory}},
month = feb,
title = {Strong Coordination of Signals and Actions over Noisy Channels with two-sided State Information},
year = {2020},
eprint = {1801.10543}
}


Conference proceedings
1. G. Cervia, L. Luzzi, M. Le Treust, and M. R. Bloch, “Strong coordination over noisy channels with strictly causal encoding,” in Proc. of 56th Annual Allerton Conference on Communication, Control, and Computing, Oct. 2018, pp. 519–526.

We consider a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of strictly causal encoding and non-causal decoding, we prove inner and outer bounds for the strong coordination region and show that the inner bound is achievable with polar codes.

@inproceedings{Cervia2018a,
author = {Cervia, Giulia and Luzzi, Laura and {Le Treust}, Mael and Bloch, Matthieu R},
title = {Strong coordination over noisy channels with strictly causal encoding},
booktitle = {Proc. of 56th Annual Allerton Conference on Communication, Control, and Computing},
year = {2018},
pages = {519-526},
month = oct,
doi = {10.1109/ALLERTON.2018.8635991},
eprint = {1809.10934},
groups = {Coordination of networks},
keywords = {Decoding;Encoding;Noise measurement;Memoryless systems;Markov processes;Communication networks}
}


2. G. Cervia, L. Luzzi, M. L. Treust, and M. R. Bloch, “Strong Coordination of Signals and Actions over Noisy Channels,” in Proc. of IEEE International Symposium on Information Theory, Aachen, Germany, Jun. 2017, pp. 2845–2849.

We develop a random binning scheme for strong coordination in a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme and develop inner and outer bounds for the strong coordination region. While the set of achievable target distributions is the same as for empirical coordination, we characterize the rate of common randomness required for strong coordination.

@inproceedings{Cervia2017,
author = {Cervia, Giulia and Luzzi, Laura and Treust, Ma\"el Le and Bloch, Matthieu R},
title = {Strong Coordination of Signals and Actions over Noisy Channels},
booktitle = {Proc. of IEEE International Symposium on Information Theory},
year = {2017},
pages = {2845--2849},
month = jun,
doi = {10.1109/ISIT.2017.8007047},
groups = {Coordination of networks},
howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}}
}


3. G. Cervia, L. Luzzi, M. R. Bloch, and M. L. Treust, “Polar coding for empirical coordination of signals and actions over noisy channels,” in Proc. of IEEE Information Theory Workshop, Cambridge, United Kingdom, Sep. 2016, pp. 81–85.

We develop a polar coding scheme for empirical coordination in a two-node network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction. In the case of non-causal encoding and decoding, we show that polar codes achieve the best known inner bound for the empirical coordination region, provided that a vanishing rate of common randomness is available. This scheme provides a constructive alternative to random binning and coding proofs.

@inproceedings{Cervia2016,
author = {Cervia, G. and Luzzi, L. and Bloch, M. R. and Treust, M. Le},
title = {Polar coding for empirical coordination of signals and actions over noisy channels},
booktitle = {Proc. of IEEE Information Theory Workshop},
year = {2016},
pages = {81-85},
month = sep,
doi = {10.1109/ITW.2016.7606800},
groups = {Coordination of networks},
keywords = {Conferences;Decoding;Electronic mail;Encoding;Noise measurement},
owner = {mattbloch},
timestamp = {2016.03.20}
}


4. C. Ling, L. Luzzi, and M. R. Bloch, “Secret key generation from Gaussian sources using lattice hashing,” in Proc. of IEEE International Symposium on Information Theory, Istanbul, Turkey, Jul. 2013, pp. 2621–2625.

@inproceedings{Lin2013,
author = {Ling, Cong and Luzzi, Laura and Bloch, Matthieu R.},
title = {Secret key generation from Gaussian sources using lattice hashing},
booktitle = {Proc. of IEEE International Symposium on Information Theory},
year = {2013},
pages = {2621-2625},
month = jul,
doi = {10.1109/ISIT.2013.6620701},
eprint = {1306.5299},
file = {:2010-Ling-ISIT.pdf:PDF},
groups = {Secret key agreement},
issn = {2157-8095},
keywords = {Encoding;Error probability;Lattices;Quantization (signal);Vectors;Zinc},
owner = {mattbloch},
quality = {1},
timestamp = {2013.01.21}
}


5. M. R. Bloch, L. Luzzi, and J. Kliewer, “Strong Coordination with Polar Codes,” in Proc. of 50th Allerton Conference on Communication, Control, and Computing, Monticello, IL, Oct. 2012, pp. 565–571.

In this paper, we design explicit codes for strong coordination in two-node networks. Specifically, we consider a two-node network in which the action imposed by nature is binary and uniform, and the action to coordinate is obtained via a symmetric discrete memoryless channel. By observing that polar codes are useful for channel resolvability over binary symmetric channels, we prove that nested polar codes achieve a subset of the strong coordination capacity region, and therefore provide a constructive and low complexity solution for strong coordination.

@inproceedings{Bloch2012a,
author = {Bloch, Matthieu R. and Luzzi, Laura and Kliewer, Joerg},
title = {{S}trong Coordination with Polar Codes},
booktitle = {Proc. of 50th Allerton Conference on Communication, Control, and Computing},
year = {2012},
pages = {565-571},
month = oct,
arxiv = {1210.2159},
doi = {10.1109/Allerton.2012.6483268},
file = {:2012-Bloch-Allerton.pdf:PDF},
groups = {Coordination of networks, Polar codes},
howpublished = {accepted to \emph{50th Allerton Conference on Communication, Control, and Computing}},
owner = {mattbloch},
timestamp = {2012.07.15}
}


6. L. Luzzi and M. R. Bloch, “Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels,” in Proc. of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, Cachan, France, May 2011, pp. 641–647.

@inproceedings{Luzzi2011,
author = {Luzzi, Laura and Bloch, Matthieu R.},
booktitle = {Proc. of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools},
title = {{C}apacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels},
year = {2011},