Zobrazeno 11 - 20
of 55
pro vyhledávání: '"Battaglioni, Massimo"'
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-density parity-check (MDPC) codes. We show that the feasibility of these a
Externí odkaz:
http://arxiv.org/abs/1904.12215
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 in their Tanner graph representation. Depending on the context, such ha
Externí odkaz:
http://arxiv.org/abs/1904.07158
Autor:
Battaglioni, Massimo, Tasdighi, Alireza, Baldi, Marco, Tadayon, Mohammad H., Chiaraluce, Franco
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 these requirements can be fulfilled by using some special quasi-cyclic l
Externí odkaz:
http://arxiv.org/abs/1809.04662
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tadayon, Mohammad H., Tasdighi, Alireza, Battaglioni, Massimo, Baldi, Marco, Chiaraluce, Franco
We propose a low-complexity method to find quasi-cyclic low-density parity-check block codes with girth 10 or 12 and shorter length than those designed through classical approaches. The method is extended to time-invariant spatially coupled low-densi
Externí odkaz:
http://arxiv.org/abs/1804.06454
Autor:
Battaglioni, Massimo1 (AUTHOR) m.battaglioni@univpm.it, Chiaraluce, Franco1 (AUTHOR), Baldi, Marco1 (AUTHOR), Pacenti, Michele2 (AUTHOR), Mitchell, David G. M.3 (AUTHOR)
Publikováno v:
EURASIP Journal on Wireless Communications & Networking. 7/25/2023, Vol. 2023 Issue 1, p1-29. 29p.
Autor:
Battaglioni, Massimo, Tasdighi, Alireza, Cancellieri, Giovanni, Chiaraluce, Franco, Baldi, Marco
In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check (QC-LDPC) block codes and exploit suitable unw
Externí odkaz:
http://arxiv.org/abs/1703.00332
We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping procedure
Externí odkaz:
http://arxiv.org/abs/1605.05560
Autor:
Weger, Violetta, Khathuria, Karan, Horlemann, Anna-Lena, Battaglioni, Massimo, Santini, Paolo, Persichetti, Edoardo
Publikováno v:
Advances in Mathematics of Communications; Feb2024, Vol. 18 Issue 1, p1-34, 34p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.