Results 51 to 60 of about 54,560 (207)
Analysis of Near-Capacity Iterative Decoding Schemes for Wireless Communication Using EXIT Charts
IEEE Access, 2020 This article proposes and compares the performance of three flexible and bandwidth efficient transceivers. The terminology of Over-Complete Mapping (OCM) is introduced in the first two schemes.
Nasru Minallah +6 more
doaj +1 more source
Reduced complexity hard‐ and soft‐input BCH decoding with applications in concatenated codes
IET Circuits, Devices and Systems, 2021 Error correction coding for optical communication and storage requires high rate codes that enable high data throughput and low residual errors. Recently, different concatenated coding schemes were proposed that are based on binary BCH codes with low ...
Jürgen Freudenberger +2 more
doaj +1 more source
Improved DC-Free Run-Length Limited 4B6B Codes for Concatenated Schemes
IEEE Access, 2022 In this letter, we introduce a class of improved DC-free 4B6B codes in terms of error correction capabilities for a serially concatenated architecture. There are billions of different codebooks that can be derived from the 16 codewords contained in the ...
Elie Ngomseu Mambou +2 more
doaj +1 more source
Iterative Decoding of Concatenated Codes: A Tutorial
EURASIP Journal on Advances in Signal Processing, 2005 The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo ...
Phillip A. Regalia
doaj +1 more source
From concatenated codes to graph codes [PDF]
Manufacturing Engineer, 2005 We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing in trees.
J. Justesen, T. Hoholdt
openaire +1 more source
Gossip Codes for Fingerprinting: Construction, Erasure Analysis and Pirate Tracing
, 2005 This work presents two new construction techniques for q-ary Gossip codes from tdesigns and Traceability schemes. These Gossip codes achieve the shortest code length specified in terms of code parameters and can withstand erasures in digital ...
Gulati, V. P. +3 more
core +2 more sources
Comparing the Overhead of Topological and Concatenated Quantum Error Correction
, 2013 This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator Toolbox (QuRE) that we recently developed. We use QuRE to
Chong, Frederic T. +5 more
core +1 more source
Experimental Implementation of a Concatenated Quantum Error-Correcting Code [PDF]
, 2004 Concatenated coding provides a general strategy to achieve the desired level of noise protection in quantum information storage and transmission. We report the implementation of a concatenated quantum error-correcting code able to correct against phase ...
A. M. Steane +6 more
core +1 more source
Throughput enhancing concatenated codes [PDF]
IET Communications, 2019 Traditionally, concatenation of codes is used to increase the coding gain at the expense of the code rate and the throughput. In contrast, throughput enhancing concatenated codes (TECCs) are constructed here aiming to increase the throughput.
Elahe Rezaei, John P. Fonseka, Yu Bo
openaire +1 more source
Spatially Coupled Turbo Codes [PDF]
, 2014 In this paper, we introduce the concept of spatially coupled turbo codes (SC-TCs), as the turbo codes counterpart of spatially coupled low-density parity-check codes. We describe spatial coupling for both Berrou et al. and Benedetto et al.
Amat, Alexandre Graell i +2 more
core +2 more sources