Results 21 to 30 of about 2,489,617 (196)
On the Construction and Decoding of Concatenated Polar Codes [PDF]
2013 IEEE International Symposium on Information Theory, 2013 A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate.
Hessam Mahdavifar +3 more
openalex +5 more sources
ELF Codes: Concatenated Codes with an Expurgating Linear Function as the Outer Code [PDF]
International Symposium on Turbo Codes and Iterative Information Processing, 2023 An expurgating linear function (ELF) is an outer code that disallows low-weight codewords of the inner code. ELFs can be designed either to maximize the minimum distance or to minimize the codeword error rate (CER) of the expurgated code. A list-decoding
R. Wesel +5 more
semanticscholar +1 more source
Concatenated Codes for Multiple Reads of a DNA Sequence [PDF]
IEEE Transactions on Information Theory, 2021 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.
I. Maarouf +5 more
semanticscholar +1 more source
Gottesman-Kitaev-Preskill codes: A lattice perspective [PDF]
Quantum, 2022 We examine general Gottesman-Kitaev-Preskill (GKP) codes for continuous-variable quantum error correction, including concatenated GKP codes, through the lens of lattice theory, in order to better understand the structure of this class of stabilizer codes.
Jonathan Conrad +2 more
doaj +1 more source
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
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 +8 more sources
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 Polar codes [PDF]
2010 IEEE International Symposium on Information Theory, 2010 Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems. One significant drawback, however, is that for current constructions the probability of error decays sub-exponentially in the block-length (more detailed ...
Bakshi, Mayank +2 more
openaire +5 more sources