This paper investigates the application of gradient descent with momentum in symbol
flipping decoding algorithms based on prediction (SFDP) for non-binary low-density parity …

Dimming control is of vital importance for visible light communication (VLC) systems.
Conventional dimmable transmission schemes based on compensation are spectrally …

Theorem 1. Let G1 (V, C) and G2 (V, C) be two bipartite graphs with the same disjoint vertex
sets V and C, and corresponding biadjacency matrices A1 and A2, respectively. If A2 is …

In this paper, we prove that a linear block code with girth is a-sequential-recovery locally
repairable codes (LRCs) with locality if its parity-check matrix has column weight at least 2 …

There is a concept in graph theory known as a chord which has not been considered before
in relation to trapping sets of Tanner graphs. A chord of a cycle is an edge outside the cycle …

Array‐based non‐binary (NB) low‐density parity‐check (LDPC) codes are attractive in
practice for their advantages in implementation and performance. However, existing …

We give a framework that generalizes LDPC code constructions using transversal designs
or related structures such as mutually orthogonal Latin squares. Our constructions offer a …

In this paper, we focus on short-block nonbinary LDPC (NB-LDPC) codes based on cyclic
codes. Based on Tanner graphs' isomorphism, we present an efficient search algorithm for …

Dear editor, Many research results show that, for equivalent bit length, short nonbinary
LDPC codes outperform binary LDPC codes by about 1 dB [1–3]. Moreover, nonbinary …