English
Related papers

Related papers: Analysis and Design of Tuned Turbo Codes

200 papers

The error-pattern correcting code (EPCC) is incorporated in the design of a turbo equalizer (TE) with aim to correct dominant error events of the inter-symbol interference (ISI) channel at the output of its matching Viterbi detector. By…

Information Theory · Computer Science 2015-03-13 Hakim Alhussien , Jaekyun Moon

Space charge has been a limiting factor for low energy accelerators inducing emittance growth and tune spread. Tune shift and tune spread parameters are important for avoiding resonances, which limit intensity of the beam. Circular modes…

Accelerator Physics · Physics 2024-10-15 Onur Gilanliogullari , Brahim Mustapha , Pavel Snopok

We explicitly construct an infinite family of asymptotically good concatenated quantum stabilizer codes where the outer code uses CSS-type quantum Reed-Solomon code and the inner code uses a set of special quantum codes. In the field of…

Quantum Physics · Physics 2009-01-06 Zhuo Li , Li-Juan Xing , Xin-Mei Wang

This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in the receivers. Specifically, it is first shown that the optimum error correction code that…

Information Theory · Computer Science 2019-09-27 Eren Balevi , Jeffrey G. Andrews

In this paper, we introduce the concept of spatially coupled turbo-like codes (SC-TCs) as the spatial coupling of a number of turbo-like code ensembles. In particular, we consider the spatial coupling of Berrou et al. parallel concatenated…

Information Theory · Computer Science 2017-10-03 Saeedeh Moloudi , Michael Lentmaier , Alexandre Graell i Amat

In this paper, we give a geometric characterization of minimal linear codes. In particular, we relate minimal linear codes to cutting blocking sets, introduced in a recent paper by Bonini and Borello. Using this characterization, we derive…

Information Theory · Computer Science 2019-12-13 Gianira Nicoletta Alfarano , Martino Borello , Alessandro Neri

The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root…

Information Theory · Computer Science 2015-06-10 Alexander Zeh , Markus Ulmschneider

Partially information coupled turbo codes (PIC-TCs) is a class of spatially coupled turbo codes that can approach the BEC capacity while keeping the encoding and decoding architectures of the underlying component codes unchanged. However,…

Information Theory · Computer Science 2020-06-23 Xiaowei Wu , Min Qiu , Jinhong Yuan

We introduce a novel mechanism, called timid/bold coding, by which feedback can be used to improve coding performance. For a certain class of DMCs, called compound-dispersion channels, we show that timid/bold coding allows for an improved…

Information Theory · Computer Science 2019-09-02 Aaron B. Wagner , Nirmal V. Shende , Yücel Altuğ

Color codes are a leading class of topological quantum error-correcting codes with modest error thresholds and structural compatibility with two-dimensional architectures, which make them well-suited for fault-tolerant quantum computing…

Quantum Physics · Physics 2026-04-07 Nitish Kumar Chandra , David Tipper , Reza Nejabati , Eneet Kaur , Kaushik P. Seshadreesan

In this paper, we consider weighted nonbinary repeat multiple-accumulate (WNRMA) code ensembles obtained from the serial concatenation of a nonbinary rate-1/n repeat code and the cascade of L>= 1 accumulators, where each encoder is followed…

Information Theory · Computer Science 2011-02-01 Eirik Rosnes , Alexandre Graell i Amat

This paper is devoted to the finite-length analysis of turbo decoding over the binary erasure channel (BEC). The performance of iterative belief-propagation (BP) decoding of low-density parity-check (LDPC) codes over the BEC can be…

Information Theory · Computer Science 2011-05-31 Eirik Rosnes , Øyvind Ytrehus

In this article we extend the idea of Turbo codes onto the Real Field. The channel is taken to result in block erasures and the only noise as being that due to quantization. The decoding in this case is reduced to reconstruction of the lost…

Combinatorics · Mathematics 2007-05-23 Animesh Datta

We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting…

Information Theory · Computer Science 2011-08-16 Qiwen Wang , Sidharth Jaggi , Shuo-Yen Robert Li

Tuning parameters are parameters involved in an estimating procedure for the purpose of reducing the risk of some other estimator. Examples include the degree of penalization in penalized regression and likelihood problems, as well as the…

Statistics Theory · Mathematics 2026-03-31 Ingrid Dæhlen , Nils Lid Hjort , Ingrid Hobæk Haff

In this work novel results concerning Network-on-Chip-based turbo decoder architectures are presented. Stemming from previous publications, this work concentrates first on improving the throughput by exploiting adaptive-bandwidth reduction…

Hardware Architecture · Computer Science 2011-05-06 Maurizio Martina , Guido Masera

In this paper, a new detection algorithm is proposed for turbo coded Code Division Multiple Access (CDMA) signals in detect and forward cooperative channels. Use of user cooperation makes much improvement in the performance of CDMA systems.…

Signal Processing · Electrical Eng. & Systems 2018-03-13 Ebrahim Karami

Future 5G systems will need to support ultra-reliable low-latency communications scenarios. From a latency-reliability viewpoint, it is inefficient to rely on average utility-based system design. Therefore, we introduce the notion of…

Information Theory · Computer Science 2019-02-05 Derya Malak , Muriel Médard , Edmund M. Yeh

Homological product codes are a class of codes that can have improved distance while retaining relatively low stabilizer weight. We show how to build union-find decoders for these codes, using a union-find decoder for one of the codes in…

Quantum Physics · Physics 2021-03-10 Nicolas Delfosse , Matthew B. Hastings

The construction of optimal linear block error-correcting codes is not an easy problem, for this, many studies describe methods for generating good error correcting codes in terms of minimum distance. In a previous work, we have presented…

Information Theory · Computer Science 2015-09-11 M. Askali , S. Nouh , A. Azouaoui , M. Belkasmi