Marco Ferrari

Orcid: 0000-0001-6063-1910

Affiliations:
  • Politecnico di Milano, CNR-IEIIT, Milan, Italy (PhD 2000)


According to our database1, Marco Ferrari authored at least 47 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Generalized Quantum-assisted Digital Signature.
CoRR, 2024

Multi-Tb/s Transmission Based on DMT-Modulated VCSELs in Metro Networks Assisted by Volterra Equalization.
IEEE Access, 2024

Quantum-Assisted Digital Signature in an SDN-controlled Optical Network.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2024

Low-Complexity Pearson-Based Detection for AWGN Channels with Offset.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Quantum-assisted digital signature: a new service for future quantum-integrated optical networks.
Proceedings of the 24th International Conference on Transparent Optical Networks, 2024

Flexible Blind Information Reconciliation for QKD based on Rateless Protograph LDPC codes.
Proceedings of the 24th International Conference on Transparent Optical Networks, 2024

2023
A Sphere Packing Bound for Vector Gaussian Fading Channels Under Peak Amplitude Constraints.
IEEE Trans. Inf. Theory, 2023

Estimation of Source Direction with Spherical Array Receiver in Molecular Communication.
Proceedings of the 17th IEEE International Symposium on Medical Information and Communication Technology, 2023

2022
Asymptotic MIMO Channel Model for Diffusive MC With Fully-Absorbing Receivers.
IEEE Wirel. Commun. Lett., 2022

Channel Characterization of Diffusion-Based Molecular Communication With Multiple Fully-Absorbing Receivers.
IEEE Trans. Commun., 2022

The Capacity of Fading Vector Gaussian Channels Under Amplitude Constraints on Antenna Subsets.
Proceedings of the IEEE Information Theory Workshop, 2022

2021
The Capacity of the Amplitude-Constrained Vector Gaussian Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Relative angle estimation of an interferer in a diffusion-based molecular communication system.
Proceedings of the NANOCOM '20: The Seventh Annual ACM International Conference on Nanoscale Computing and Communication, 2020

Two is Better than One: Reducing the Loss of the Window Decoder for SC-LDPC Codes.
Proceedings of the IEEE Information Theory Workshop, 2020

A Sphere Packing Bound for AWGN MIMO Fading Channels under Peak Amplitude Constraints.
Proceedings of the IEEE Information Theory Workshop, 2020

Capacity Bounds for Amplitude-Constrained AWGN MIMO Channels with Fading.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Message Flow Analysis in Practical LDPC Decoders for the Interpretation of Absorbing Set Thresholds.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Thresholds of Absorbing Sets Under Scaled Min-Sum LDPC Decoding.
IEEE Trans. Commun., 2019

2018
Ultra-Fast Error Correction and Detection for Low-Latency Storage Applications with Emerging Memories.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2018

2017
Thresholds of Absorbing Sets in Low-Density Parity-Check Codes.
IEEE Trans. Commun., 2017

Analysis of practical LDPC decoders in tanner graphs with absorbing sets.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

2016
Fast Decoding ECC for Future Memories.
IEEE J. Sel. Areas Commun., 2016

2015
Safe Early Stopping for Layered LDPC Decoding.
IEEE Commun. Lett., 2015

2013
Efficient OFDM Channel Estimation via an Information Criterion.
IEEE Trans. Wirel. Commun., 2013

On the Constrained Capacity of Block Differential Modulation and Detection.
IEEE Trans. Commun., 2013

2012
Low-Complexity Z<sub>4</sub> LDPC Code Design under a Gaussian Approximation.
IEEE Wirel. Commun. Lett., 2012

On the Reduction of Additive Complexity of Cyclotomic FFTs.
IEEE Trans. Commun., 2012

Hardware oriented, quasi-optimal detectors for iterative and non-iterative MIMO receivers.
EURASIP J. Wirel. Commun. Netw., 2012

Analysis of a Hurst parameter estimator based on the modified Allan variance.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011
On the Structure of Cyclotomic Fourier Transforms and Their Applications to Reed-Solomon Codes.
IEEE Trans. Commun., 2011

2010
Low Complexity, Quasi-Optimal MIMO Detectors for Iterative Receivers.
IEEE Trans. Wirel. Commun., 2010

A Hardware Oriented, Low-Complexity LORD MIMO Detector.
Proceedings of IEEE International Conference on Communications, 2010

2009
Rate Variable, Multi-Binary Turbo Codes with Controlled Error-Floor.
IEEE Trans. Commun., 2009

On the selection of semi-orthogonal users for zero-forcing beamforming.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A K-Best Version of the Turbo-LORD MIMO Detector in Realistic Settings.
Proceedings of IEEE International Conference on Communications, 2009

2008
A II-HARQ scheme for BEC models with ML decoding of Turbo Codes.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Maximum Likelihood Decoding of Turbo Codes on the Binary Erasure Channel.
Proceedings of IEEE International Conference on Communications, 2008

2007
Information Theory Performance of Reed-Solomon codes in concatenated schemes with nonideal interleaving.
Eur. Trans. Telecommun., 2007

Turbo-LORD: A MAP-Approaching Soft-Input Soft-Output Detector for Iterative MIMO Receivers.
Proceedings of the Global Communications Conference, 2007

2006
A Low Complexity Turbo MMSE Receiver for W-LAN MIMO Systems.
Proceedings of IEEE International Conference on Communications, 2006

2005
Weight spectrum evaluation for multi-binary tailbiting turbo codes.
IEEE Commun. Lett., 2005

Colored visual tags: a robust approach for augmented reality.
Proceedings of the Advanced Video and Signal Based Surveillance, 2005

2004
Refinements and asymptotic performance of bandwidth-efficient turbo product codes.
IEEE Trans. Commun., 2004

2003
Existence and uniqueness of the solution for turbo decoding of parallel concatenatedsingle parity check codes.
IEEE Trans. Inf. Theory, 2003

2002
Prunable S-random interleavers.
Proceedings of the IEEE International Conference on Communications, 2002

2001
Importance sampling simulation of turbo product codes.
Proceedings of the IEEE International Conference on Communications, 2001

Performance of concatenated Reed-Solomon and turbo codes with non ideal interleaving.
Proceedings of the Global Telecommunications Conference, 2001


  Loading...