Results 31 to 40 of about 2,451,117 (239)
Spatially Coupled Serially Concatenated Codes: Performance Evaluation and VLSI Design Tradeoffs
IEEE Transactions on Circuits and Systems Part 1: Regular Papers, 2022 Spatially coupled serially concatenated codes (SC-SCCs) are constructed by coupling several classical turbo-like component codes. The resulting spatially coupled codes provide a close-to-capacity performance and low error floor, which have attracted a ...
M. Mahdavi +6 more
semanticscholar +1 more source
The Effect of Coupling Memory and Block Length on Spatially Coupled Serially Concatenated Codes [PDF]
IEEE Vehicular Technology Conference, 2020 Spatially coupled serially concatenated codes (SC-SCCs) are a class of spatially coupled turbo-like codes, which have a close-to-capacity performance and low error floor.
M. Mahdavi +5 more
semanticscholar +1 more source
Concatenated Codes for Recovery From Multiple Reads of DNA Sequences [PDF]
Information Theory Workshop, 2020 Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems.
A. Lenz +5 more
semanticscholar +1 more source
Towards Fully Pipelined Decoding of Spatially Coupled Serially Concatenated Codes
International Symposium on Turbo Codes and Iterative Information Processing, 2021 Having close-to-capacity performance and low error floor, even for small block lengths, make spatially coupled serially concatenated codes (SC-SCCs) a very promising class of codes.
M. Mahdavi +5 more
semanticscholar +1 more source
Concatenated codes with convolutional inner codes [PDF]
IEEE Transactions on Information Theory, 1988 We study the minimum distance of concatenated codes with Reed-Solomon outer codes and convolutional inner codes. For suitable combinations of parameters the minimum distance may be lower-bounded by the product of the minimum distances of the inner and outer codes.
Thommesen, Christian +2 more
openaire +4 more sources
Improved adaptive belief propagation algorithm with reduced complexity for concatenated SPC‐RS codes
Electronics Letters, 2023 In this letter, a novel single parity check‐aided minimum sum (SPC‐aided MS) algorithm is proposed. A cascaded compiled code scheme is used to approximate the adaptive belief propagation (ABP) algorithm for Reed–Solomon (RS) codes using the min sum (MS ...
Yuan Cheng +5 more
doaj +1 more source
Coding in the existential theory of concatenation [PDF]
Archiv für Mathematische Logik und Grundlagenforschung, 1987 The authors show that every existentially definable relation over concatenation is diophantine. They define a 647 (1987; Zbl 0639.03057).
Büchi, J. R., Senger, St.
openaire +2 more sources
The concatenated structure of quasi-abelian codes [PDF]
Designs, Codes and Cryptography, 2021 The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Solé, (2001)). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions ...
Borello, Martino +3 more
openaire +7 more sources
IEEE Transactions on Communications, 2022 In this paper, a method for joint source-channel coding (JSCC) based on concatenated spatially coupled low-density parity-check (SC-LDPC) codes is investigated.
A. Golmohammadi, David G. M. Mitchell
semanticscholar +1 more source
Generalized concatenated quantum codes [PDF]
Physical Review A, 2009 We introduce the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we construct families of new single-error-correcting nonadditive quantum codes, in both binary and nonbinary cases ...
Bei Zeng +5 more
openaire +4 more sources