Coded slotted ALOHA: A graph-based method for uncoordinated multiple access
In this paper, a random access scheme is introduced, which relies on the combination of
packet erasure correcting codes and successive interference cancellation (SIC). The …
packet erasure correcting codes and successive interference cancellation (SIC). The …
ALOHA random access that operates as a rateless code
Various applications of wireless Machine-to-Machine (M2M) communications have
rekindled the research interest in random access protocols, suitable to support a large …
rekindled the research interest in random access protocols, suitable to support a large …
High throughput random access via codes on graphs: Coded slotted ALOHA
In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access
scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC …
scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC …
Spatially-coupled random access on graphs
In this paper we investigate the effect of spatial coupling applied to the recently-proposed
coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the …
coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the …
Graph-based random access for the collision channel without feedback: Capacity bound
A random access scheme for the collision channel without feedback is proposed. The
scheme is based on erasure correcting codes for the recovery of packet segments that are …
scheme is based on erasure correcting codes for the recovery of packet segments that are …
Generalized LDPC codes for ultra reliable low latency communication in 5G and beyond
Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints
on the code bits are replaced with generalized constraints (an arbitrary linear code), are a …
on the code bits are replaced with generalized constraints (an arbitrary linear code), are a …
Trap** and absorbing set enumerators for irregular generalized low-density parity-check code ensembles
The definitions of (elementary) trap** and (fully) absorbing sets are extended to
generalized low-density parity-check (GLDPC) codes. In particular, the fully absorbing sets …
generalized low-density parity-check (GLDPC) codes. In particular, the fully absorbing sets …
Doubly-generalized LDPC codes: Stability bound over the BEC
The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary
erasure channel (BEC) fulfills an upper bound depending only on the variable and check …
erasure channel (BEC) fulfills an upper bound depending only on the variable and check …
Random access on graphs: A survey and new results
This paper overviews the recently proposed coded slotted ALOHA (CSA) random access
scheme and illustrates some new results in this area. In CSA, a randomly picked linear block …
scheme and illustrates some new results in this area. In CSA, a randomly picked linear block …
A probabilistic peeling decoder to efficiently analyze generalized LDPC codes over the BEC
In this paper, we analyze the tradeoff between coding rate and asymptotic performance of a
class of generalized low-density parity-check (GLDPC) codes constructed by including a …
class of generalized low-density parity-check (GLDPC) codes constructed by including a …