We search for good regular quasi-cyclic (QC) LDPC codes with J= 2 ones in each column. In order to simplify the search, QC LDPC codes are represented in the form of tail-biting (TB) …
We consider regular block and convolutional LDPC codes determined by paritycheck matrices with rows of a fixed weight and columns of weight 2. Such codes can be described …
V Sidorenko, C Medina… - 2007 IEEE International …, 2007 - ieeexplore.ieee.org
It is well known that convolutional codes can be considered as block codes over a field of rational functions. Being a block code, every convolutional code has" block" distance d f. The …
F Hug, IE Bocharova, R Johannesson… - IEEE transactions on …, 2010 - ieeexplore.ieee.org
A rate R= 5/20 hypergraph-based woven convolutional code with overall constraint length 67 and constituent convolutional codes is presented. It is based on a 3-partite, 3-uniform, 4 …
This thesis is devoted to a range of questions in applied mathematics and signal processing motivated by applications in error correction, compressed sensing, and writing on non …
A Kreshchuk, I Zhilin, V Zyablov - … Castle Meeting on Coding Theory and …, 2017 - Springer
In this paper we propose a woven block code construction based on two convolutional codes. We also propose a soft-input decoder that allows this construction to have better error …
V Zyablov, M Loncar, R Johannesson… - 2008 5th International …, 2008 - ieeexplore.ieee.org
Hamming code-based LDPC (H-LDPC) block codes are obtained by replacing single parity- check codes in Gallager's LDPC codes with Hamming constituent codes. This paper …
Modern communication systems are designed to enable reliable and fast information transfer. Therefore, efficient channel coding and decoding strategies are needed, which …
Constructions of woven graph codes based on constituent block and convolutional codes are studied. The constructions are based on s-partite s-uniform hypergraphs, where s …