This study considers the optimisation of multi‐edge type low‐density parity‐check (MET‐
LDPC) codes to maximise the decoding threshold. The authors propose an algorithm to …

The complexity-performance trade-off is a fundamental aspect of the design of low-density
parity-check (LDPC) codes. In this paper, we consider LDPC codes for the binary erasure …

In this paper, we present an extension of the semi-definite programming formulation of the
optimal rate code design in single link Binary Erasure Channel (BEC) proposed by the …

This paper reports the principles of building irregular codes with a low density of parity
checks. It has been determined that finding irregular finite-length codes with improved …

This letter proposes a fast optimization procedure to design bilayer-expurgated low density
parity check codes in the relay channel. The code optimization problem aims to maximize …

In this paper, we solve the optimizing problem of designing Low-Density Parity Check codes
for two parallel erasure links based on the known SDP approach. We show that our …

This paper considers the optimization of multi-edge type low-density parity-check
(METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly …

In this paper, we present a family of irregular Low-Density Parity-Check (LDPC) code
ensemble, which is designed for Binary Symmetric Channel (BSC) with maximum …

We introduce a novel method and two algorithms for designing efficient degree distributions
with minimum overhead for online codes. The first algorithm is the general form for solving …

This thesis is concerned with the analysis and design of a powerful and flexible family of
error correcting codes called graph-based codes. More specifically, we consider fixed rate …