50 citations · 75 across the 23 of their papers we have counts for
27 papers
Design of a Family of Rate-Adaptive LDPC Convolutional Codes with Short Constraint Length
Massimo Battaglioni, Edoardo Carnevali, Franco Chiaraluce +2
This paper studies the design of some high-rate, adaptive, low-density parity-check (LDPC) convolutional codes with short constraint length, based on interleaved parity-check polyn…
Short-Boundary Signaling for Asynchronous Grant-Free Control-to-Control Communications
Massimo Battaglioni, Dania De Crescenzo, Edoardo Carnevali +1
In asynchronous grant-free access, receivers must detect variable-length transmissions and identify their start and end. Existing decoder-aided receivers use start and tail sequenc…
High-Rate Quasi-Dyadic Quantum LDPC Codes
Alessio Baldelli, Sisi Miao, Laurent Schmalen +2
In this work, we propose a novel design of high-rate Calderbank--Shor--Steane (CSS) quantum low-density parity-check (QLDPC) codes based on quasi-dyadic matrices. The Tanner graphs…
Quantum XYZ Stabilizer Codes
Alessio Baldelli, Davide Orsucci, Francisco Lázaro +1
Stabilizer codes are often constructed within the Calderbank--Shor--Steane (CSS) framework, where two mutually orthogonal binary classical codes define and -type stabilizer…
On Constructing and Decoding Quantum Triorthogonal Codes
Alessio Baldelli, Olai Å. Mostad, Hsuan-Yin Lin +2
Triorthogonal codes are a basic ingredient in magic-state distillation, as they enable transversal implementation of logical gates. As a non-Clifford operation, the $\…
A Deep Learning-based Receiver for Asynchronous Grant-Free Random Access in Control-to-Control Networks
Massimo Battaglioni, Edoardo Carnevali, Dania De Crescenzo +3
In this paper, we study grant-free, asynchronous control-to-control (C2C) communications in an indoor scenario with a shared wireless channel. Each communication node transmits com…
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
Alessio Baldelli, Marco Baldi, Massimo Battaglioni +2
Quantum error correcting codes are essential to achieve fault-tolerant quantum computation. This work introduces two constructions of high-rate, dual-containing (DC) Calderbank--Sh…
Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding
Alessio Baldelli, Massimo Battaglioni, Jonathan Mandelbaum +2
Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In t…
Data Certification Strategies for Blockchain-based Traceability Systems
Giacomo Zonneveld, Giulia Rafaiani, Massimo Battaglioni +1
The use of blockchains for data certification and traceability is now well established in both the literature and practical applications. However, while blockchain-based certificat…
Design and Analysis of the Tail Sequence for Short LDPC-Coded Space Communications
Massimo Battaglioni, Kenneth Andrews, Rebecca Giuliani +3
According to some standards for satellite communications, the transmitted stream is divided into transmission units with variable length, for which detecting the termination is par…
Decentralized Biometric Authentication based on Fuzzy Commitments and Blockchain
Nibras Abo Alzahab, Giulia Rafaiani, Massimo Battaglioni +2
Blockchain technology, which was introduced for supporting cryptocurrencies, today provides a decentralized infrastructure for general information storage and execution of algorith…
Telecommand Rejection Probability for CCSDS-compliant LDPC-Coded Transmissions with Tail Sequence
Rebecca Giuliani, Massimo Battaglioni, Marco Baldi +2
According to the Consultative Committee for Space Data Systems (CCSDS) recommendation for TeleCommand (TC) synchronization and coding, the Communications Link Transmission Unit (CL…
Rate-compatible LDPC Codes based on Primitive Polynomials and Golomb Rulers
Massimo Battaglioni, Marco Baldi, Franco Chiaraluce +1
We introduce and study a family of rate-compatible Low-Density Parity-Check (LDPC) codes characterized by very simple encoders. The design of these codes starts from simplex codes,…
Punctured Binary Simplex Codes as LDPC codes
Massimo Battaglioni, Giovanni Cancellieri
Digital data transfer can be protected by means of suitable error correcting codes. Among the families of state-of-the-art codes, LDPC (Low Density Parity-Check) codes have receive…
MAGIC: A Method for Assessing Cyber Incidents Occurrence
Massimo Battaglioni, Giulia Rafaiani, Franco Chiaraluce +1
The assessment of cyber risk plays a crucial role for cybersecurity management, and has become a compulsory task for certain types of companies and organizations. This makes the de…
Analysis of a blockchain protocol based on LDPC codes
Massimo Battaglioni, Paolo Santini, Giulia Rafaiani +2
In a blockchain Data Availability Attack (DAA), a malicious node publishes a block header but withholds part of the block, which contains invalid transactions. Honest full nodes, w…
Optimization of a Reed-Solomon code-based protocol against blockchain data availability attacks
Paolo Santini, Giulia Rafaiani, Massimo Battaglioni +2
ASBK (named after the authors' initials) is a recent blockchain protocol tackling data availability attacks against light nodes, employing two-dimensional Reed-Solomon codes to enc…
A New Path to Code-based Signatures via Identification Schemes with Restricted Errors
Marco Baldi, Massimo Battaglioni, Franco Chiaraluce +4
In this paper we introduce a variant of the Syndrome Decoding Problem (SDP), that we call Restricted SDP (R-SDP), in which the entries of the searched vector are defined over a sub…
On the Hardness of the Lee Syndrome Decoding Problem
Violetta Weger, Karan Khathuria, Anna-Lena Horlemann +3
In this paper we study the hardness of the syndrome decoding problem over finite rings endowed with the Lee metric. We first prove that the decisional version of the problem is NP-…
Information set decoding of Lee-metric codes over finite rings
Violetta Weger, Massimo Battaglioni, Paolo Santini +3
Information set decoding (ISD) algorithms are the best known procedures to solve the decoding problem for general linear codes. These algorithms are hence used for codes without a…
Analysis of the error correction capability of LDPC and MDPC codes under parallel bit-flipping decoding and application to cryptography
Paolo Santini, Massimo Battaglioni, Marco Baldi +1
Iterative decoders used for decoding low-density parity-check (LDPC) and moderate-density parity-check (MDPC) codes are not characterized by a deterministic decoding radius and the…
Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
Paolo Santini, Massimo Battaglioni, Franco Chiaraluce +1
In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-dens…
Efficient Search and Elimination of Harmful Objects in Optimized QC SC-LDPC Codes
Massimo Battaglioni, Franco Chiaraluce, Marco Baldi +1
The error correction performance of low-density parity-check (LDPC) codes under iterative message-passing decoding is degraded by the presence of certain harmful objects existing i…
Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications
Massimo Battaglioni, Alireza Tasdighi, Marco Baldi +2
Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how th…