Results 1 to 10 of about 2,519,218 (264)
Concatenated Codes for Amplitude Damping [PDF]
2016 IEEE International Symposium on Information Theory (ISIT), 2016 We discuss a method to construct quantum codes correcting amplitude damping errors via code concatenation. The inner codes are chosen as asymmetric Calderbank-Shor-Steane (CSS) codes. By concatenating with outer codes correcting symmetric errors, many new codes with good parameters are found, which are better than the amplitude damping codes obtained ...
Bei Zeng, Markus Grassl, Tyler Jackson
arxiv +9 more sources
Graph Concatenation for Quantum Codes [PDF]
Journal of Mathematical Physics, vol. 52, no. 2, February 2011,
022201, 2009 Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an ...
Beigi, S. +4 more
arxiv +12 more sources
A Unified Ensemble of Concatenated Convolutional Codes [PDF]
arXiv, 2017 We introduce a unified ensemble for turbo-like codes (TCs) that contains the four main classes of TCs: parallel concatenated codes, serially concatenated codes, hybrid concatenated codes, and braided convolutional codes. We show that for each of the original classes of TCs, it is possible to find an equivalent ensemble by proper selection of the design
Moloudi, Saeedeh +2 more
arxiv +7 more sources
Serially Concatenated Polar Codes
IEEE Access, 2018 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 +5 more sources
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, Tom Høholdt
core +7 more sources
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
Cryptography, 2021 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 +2 more sources
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 +9 more sources
Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values
IEEE Open Journal of the Communications Society, 2022 Code-based cryptosystems are promising candidates for post-quantum cryptography. Recently, generalized concatenated codes over Gaussian and Eisenstein integers were proposed for those systems. For a channel model with errors of restricted weight, those q-
Johann-Philipp Thiers +1 more
doaj +2 more sources
Qubit-Oscillator Concatenated Codes: Decoding Formalism and Code Comparison [PDF]
PRX Quantum, 2023 Concatenating bosonic error-correcting codes with qubit codes can substantially boost the error-correcting power of the original qubit codes. It is not clear how to concatenate optimally, given that there are several bosonic codes and concatenation ...
Yijia Xu +3 more
doaj +2 more sources
Concatenated quantum codes [PDF]
, 1996 16 pages in PostScirpt, the paper is also avalaible at http://qso.lanl.gov/qc/
Knill, E., Laflamme, R.
openaire +8 more sources