Results 1 to 10 of about 14,504 (162)
Concatenated Constrained Coding: A New Approach to Efficient Constant-Weight Codes [PDF]
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small ...
Kees Schouhamer Immink +3 more
doaj +2 more sources
Serially Concatenated Polar Codes
Simulation results show that the performance of polar codes is improved vastly by using polar codes as inner codes in serially concatenated coding schemes.
Erdal Arikan
doaj +4 more sources
Concatenated codes with convolutional inner codes [PDF]
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.
V V Zyablov, J Justesen
exaly +4 more sources
An Efficient Two-Stage Decoding Scheme for LDPC-CRC Concatenated Codes [PDF]
In modern communication systems, the concatenation of a low-density parity-check (LDPC) code with a cyclic redundancy check (CRC) code is commonly used for error correction.
Lingjun Kong +3 more
doaj +2 more sources
Performance analysis of concatenated Reed–Solomon and next generation polar codes for 6G communication systems [PDF]
Burst errors are common in high data rate communication, such as in the Six-Generation (6G) communication system, which degrades its ultra-high reliability requirements.
Edom Wondimu +2 more
doaj +2 more sources
Gottesman-Kitaev-Preskill codes: A lattice perspective [PDF]
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
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem, together with the one-Mannheim ...
Johann-Philipp Thiers +1 more
doaj +1 more source
Concatenated Polar codes [PDF]
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 ...
Mayank Bakshi +2 more
openaire +3 more sources
Improved adaptive belief propagation algorithm with reduced complexity for concatenated SPC‐RS codes
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
Concatenated codes: serial and parallel [PDF]
An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers are described by bipartite graphs with good expanding properties. In particular, a modified expander code construction is shown to behave very much like Forney's classical concatenated codes, though with improved decoding complexity.
Alexander Barg, Gilles Zémor
openaire +1 more source

