Given a binary parity-check matrix $H$ and an integer $r$, the covering-radius decision problem asks whether every attainable syndrome can be represented by an error vector of Hamming weight at most $r$. We study this problem for sparse parity-check matrices with bounded row and column weights. Using a bounded-occurren...
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 polynomials. Starting from some known results regarding the selection of polynomials that yield codes free of short cycles in the associated Tann...
Massimo Battaglioni, Edoardo Carnevali, F. Chiaraluce et al.· 0 citations
This paper investigates a two-user uplink non-orthogonal multiple access (NOMA) system operating over narrowband fading channels. Both users transmit simultaneously on the same resource, generating mutual interference at two spatially separated base stations (BSs). To improve reliability under fading and asymmetric lin...
P. Terzano, Daniele Ferretti, Giuseppe Pettanice et al.· IEEE International Symposium...· 0 citations
This work proposes a novel design of high-rate Calderbank--Shor--Steane (CSS) quantum low-density parity-check (QLDPC) codes based on quasi-dyadic matrices based on quasi-dyadic matrices.