… of linear block codes over Zq that we name low-Lee-density parity-check (LLDPC) codes.
These … we introduce the new family of codes we name Low-Lee-Density Parity-Check (LLDPC) …

… class on LDPC codes (namely, for low-Lee-density parity-check codes), and its performance
might be enhanced by taking into account the differences between the two code classes. …

… The analysis developed in this paper may serve to design regular low-density paritycheck
(LDPC) codes over integer residue rings for storage and cryptographic application. …

… failure probability of a general linear block code under maximum likelihood (ML) … ) of the
code. We compute the average Lee weight distribution of low-density parity-check (LDPC) code …

… codes over GR(p2,m) [4]. The researchers introduced low-lee-density parity-check (LLDPC)
codes over Zq, characterized by low Lee weight rows and columns in the parity-check matrix …

… linear code C if its row space corresponds to C. In addition, we call a matrix H a parity-check …
of subtype (k1,...,ks) and rank K we set ks+1 = n−K and bring the paritycheck matrix into the …

… Since certain decoder types (eg, iterative decoders employed for low-density parity-check
codes defined over integer rings) require the knowledge of the channel’s marginal conditional …

… The legitimate receiver knows the private code and can use the code structure for correcting
the … GC codes with inner BCH codes over Fp and outer Reed-Solomon (RS) codes over the …

… codes [13] can retrieve the private parity check matrix. In [26], a generalized concatenated
(GC) code construction with inner OMEC codes … of low-density parity-check codes over finite …

… The problem of constructing MDS codes is a central topic in coding theory due to its wide
range of applications. In this paper, we give an analogue of the Singleton bound for codes over …