English
Related papers

Related papers: Multi-Dimensional Spatially-Coupled Code Design: E…

200 papers

For LDPC codes operating over additive white Gaussian noise channels and decoded using message-passing decoders with limited precision, absorbing sets have been shown to be a key factor in error floor behavior. Focusing on this scenario,…

Information Theory · Computer Science 2012-12-07 Jiadong Wang , Lara Dolecek , Richard Wesel

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2017-01-27 Laurent Schmalen , Vahid Aref , Fanny Jardel

We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized…

Quantum Physics · Physics 2010-02-11 Min-Hsiu Hsieh , Todd A. Brun , Igor Devetak

Spatially coupled turbo-like codes (SC-TCs) have been shown to have excellent decoding thresholds due to the threshold saturation effect. Furthermore, even for moderate block lengths, simulation results demonstrate very good bit error rate…

Information Theory · Computer Science 2018-04-06 Saeedeh Moloudi , Michael Lentmaier , Alexandre Graell i Amat

In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them to the destination such that the signal at the destination…

Information Theory · Computer Science 2008-06-20 J. Harshan , B. Sundar Rajan

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

In this paper, we introduce a deep multiple description coding (MDC) framework optimized by minimizing multiple description (MD) compressive loss. First, MD multi-scale-dilated encoder network generates multiple description tensors, which…

Computer Vision and Pattern Recognition · Computer Science 2020-01-14 Lijun Zhao , Huihui Bai , Anhong Wang , Yao Zhao

In this letter, we propose a reliability-based windowed decoding scheme for spatially-coupled (SC) low-density parity-check (LDPC) codes. To mitigate the error propagation along the sliding windowed decoder of the SC LDPC codes, a partial…

Information Theory · Computer Science 2018-05-10 Peng Kang , Yixuan Xie , Lei Yang , Jinhong Yuan

In this paper, we apply the Clique Lov\'asz Local Lemma to provide sufficient conditions on memory and lifting degree for removing certain harmful combinatorial structures in spatially-coupled (SC) codes that negatively impact decoding…

Information Theory · Computer Science 2025-09-23 Lei Huang

Multilevel coding (MLC) is a coded modulation technique which can achieve excellent performance over a range of communication channels. Polar codes have been shown to be quite compatible with communication systems using MLC, as the rate…

Information Theory · Computer Science 2021-04-21 Muhammad Zaeem Hasan , Nemanja Stefan Perović , Mark F. Flanagan

Spatially coupled (SC) interleaving is proposed to improve the performance of iterative multiuser detection and decoding (MUDD) for quasi-static fading multiple-input multiple-output systems. The linear minimum mean-squared error (LMMSE)…

Information Theory · Computer Science 2013-08-20 Keigo Takeuchi , Shuhei Horio

We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping…

Information Theory · Computer Science 2016-05-19 Marco Baldi , Massimo Battaglioni , Franco Chiaraluce , Giovanni Cancellieri

Constant dimension codes (CDCs), as special subspace codes, have received extensive attention due to their applications in random network coding. The basic problem of CDCs is to determine the maximal possible size $A_q(n,d,\{k\})$ for given…

Information Theory · Computer Science 2025-07-11 Han Li , Fang-Wei Fu

Cyclic codes have many applications in consumer electronics, communication and data storage systems due to their efficient encoding and decoding algorithms. An efficient approach to constructing cyclic codes is the sequence approach. In…

Information Theory · Computer Science 2022-10-24 Sihem Mesnager , Minjia Shi , Hongwei Zhu

We propose a low complexity complex valued Sphere Decoding (CV-SD) algorithm, referred to as Circular Sphere Decoding (CSD) which is applicable to multiple-input multiple-output (MIMO) systems with arbitrary two dimensional (2D)…

Information Theory · Computer Science 2016-11-17 Hwanchol Jang , Saeid Nooshabadi , Kiseon Kim , Heung-No Lee

In this paper, we propose two distributed linear convolutional space-time coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative communications. The DLC-STC Scheme 1 is for the case of the complete loop channel cancellation,…

Information Theory · Computer Science 2013-10-09 Yi Liu , Xiang-Gen Xia , Hailin Zhang

An $(n,k,d)$ cooperative regenerating code provides the optimal-bandwidth repair for any $t~(t\!>\!1)$ node failures in a cooperative way. In particular, an MSCR (minimum storage cooperative regenerating) code retains the same storage…

Information Theory · Computer Science 2018-10-11 Yaqian Zhang , Zhifang Zhang

Symbol-pair codes are block codes with symbol-pair metrics designed to protect against pair-errors that may occur in high-density data storage systems. MDS symbol-pair codes are optimal in the sense that it can attain the highest pair-error…

Information Theory · Computer Science 2021-11-29 Xilin Tang , Weixian Li , Wei Zhao

This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constructed based on cyclic subgroups of finite fields.…

Information Theory · Computer Science 2015-03-14 Li Zhang , Shu Lin , Khaled Abdel-Ghaffar , Zhi Ding , Bo Zhou

Folding a sequence $S$ into a multidimensional box is a method that is used to construct multidimensional codes. The well known operation of folding is generalized in a way that the sequence $S$ can be folded into various shapes. The new…

Information Theory · Computer Science 2009-07-29 Tuvi Etzion
‹ Prev 1 3 4 5 6 7 10 Next ›