Results 1 to 10 of about 477,201 (187)
A Concatenated Error-Correction System Using the $$|u|u+v|$$ Code Construction [PDF]
, 2017 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 ...
Martin Tomlinson +4 more
semanticscholar +4 more sources
Concatenated Forward Error Correction With KP4 and Single Parity Check Codes [PDF]
Journal of Lightwave Technology, 2023 Concatenated forward error correction is studied using an outer KP4 Reed-Solomon code with hard-decision decoding and inner single parity check (SPC) codes with Chase/Wagner soft-decision decoding. Analytical expressions are derived for the end-to-end frame and bit error rates for transmission over additive white Gaussian noise channels with binary ...
Diego Lentner +5 more
openalex +3 more sources
Experimental Implementation of a Concatenated Quantum Error-Correcting Code [PDF]
Physical Review Letters, 2004 Concatenated coding provides a general strategy to achieve the desired level of noise protection in quantum information storage and transmission. We report the implementation of a concatenated quantum error-correcting code able to correct against phase errors with a strong correlated component.
Lorenza Viola +3 more
arxiv +6 more sources
Concatenating quantum error-correcting codes with decoherence-free subspaces and vice versa [PDF]
Phys. Rev. A 109, 062411 (2024), 2023 Quantum error-correcting codes (QECCs) and decoherence-free subspace (DFS) codes provide active and passive means, respectively, to address certain types of errors that arise during quantum computation. The latter technique is suitable to correct correlated errors with certain symmetries and the former to correct independent errors.
Nihar Ranjan Dash +3 more
arxiv +3 more sources
Correctable noise of Quantum Error Correcting Codes under adaptive concatenation [PDF]
Phys. Rev. A 77, 010301(R) (2008), 2007 We examine the transformation of noise under a quantum error correcting code (QECC) concatenated repeatedly with itself, by analyzing the effects of a quantum channel after each level of concatenation using recovery operators that are optimally adapted to use error syndrome information from the previous levels of the code. We use the Shannon entropy of
arxiv +4 more sources
Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction [PDF]
IEEE Transactions on Information Theory, 2008 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.
Mitsuru Hamada
openalex +5 more sources
Restart Mechanisms for the Successive-Cancellation List-Flip Decoding of Polar Codes [PDF]
EntropyPolar 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
Bounds on concatenated entanglement-assisted quantum error-correcting codes [PDF]
arXivEntanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-shared entanglement to enhance the rate of error correction and communication. We study the concatenation of EAQECCs, in specific showing how the order of concatenation affects the number of ebits consumed, the logical error probability, the pseudo-threshold, and the ...
Dash, Nihar Ranjan +3 more
arxiv +3 more sources
Error Correction for Physical Unclonable Functions Using Generalized Concatenated Codes
, 2014 Physical Unclonable Functions can be used for secure key generation in cryptographic applications. It is explained how methods from coding theory must be applied in order to ensure reliable key regeneration. Based on previous work, we show ways how to obtain better results with respect to error probability and codeword length. Also, an example based on
Sven Müelich +4 more
+6 more sources
Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding
IEEE Transactions on Information Theory, 2000 We consider a concatenated coding scheme using a single inner code, a single outer code, and a fixed single-trial decoding strategy that maximizes the number of errors guaranteed to be corrected in a concatenated codeword. For this scheme, we investigate whether maximizing the guaranteed error correction rate, i.e., the number of correctable errors per
Jos H. Weber, Khaled Abdel-Ghaffar
openalex +6 more sources