Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction [PDF]
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon theoretic sense and that are decodable in polynomial time are presented.
Hamada, Mitsuru
core +7 more sources
A Concatenated Error-Correction System Using the $$|u|u+v|$$ Code Construction [PDF]
Concatenation of good codes is a classic method of constructing longer codes which are good codes. As codes are increased in length it becomes progressively harder to realise a near maximum likelihood decoder. This chapter presents a novel concatenated code arrangement featuring multiple, near maximum likelihood, decoders designed for an optimised ...
Mubarak Jibril +4 more
core +5 more sources
The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
Powerful quantum error correction codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classical codes, hashing bound approaching QECCs may be designed by exploiting a
Zunaira Babar +4 more
doaj +3 more sources
CONCATENATION OF ERROR AVOIDING WITH ERROR CORRECTING QUANTUM CODES FOR CORRELATED NOISE MODELS
We study the performance of simple error correcting and error avoiding quantum codes together with their concatenation for correlated noise models. Specifically, we consider two error models: (i) a bit-flip (phase-flip) noisy Markovian memory channel (model I); (ii) a memory channel defined as a memory degree dependent linear combination of memoryless
CAFARO C., MANCINI, Stefano
openaire +5 more sources
Restart Mechanisms for the Successive-Cancellation List-Flip Decoding of Polar Codes [PDF]
Polar codes concatenated with a cyclic redundancy check (CRC) code have been selected in the 5G standard with the successive-cancellation list (SCL) of list size L = 8 as the baseline algorithm.
Charles Pillet +3 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
Improved DC-Free Run-Length Limited 4B6B Codes for Concatenated Schemes
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
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
Experimental Implementation of a Concatenated Quantum Error-Correcting Code [PDF]
4 pages, 2 encapsulated eps figures.
Lorenza Viola +3 more
openaire +4 more sources
Most synchronization error correction codes deal with random independent insertion and deletion errors without correlation. In this paper, we propose a probabilistic channel model with correlated insertion and deletion (CID) errors to capture the data ...
Tianbo Xue
doaj +1 more source

