Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Information Theory

Composition Check Codes

Kees A. Schouhamer Immink, Kui Cai

Published Jun 29, 2017• 13 citations
Publisher

Abstract

We present composition check codes for noisy storage and transmission channels with unknown gain and/or offset. In the proposed composition check code, like in systematic error correcting codes, the encoding of the main data into a constant composition code is completely avoided. To the main data, a coded label is appended that carries information regarding the composition vector of the main data. Slepian's optimal detection technique of codewords that are taken from a constant composition code is applied for detection. A first Slepian detector detects the label and subsequently restores the composition vector of the main data. The composition vector, in turn, is used by a second Slepian detector to optimally detect the main data. We compute the redundancy and error performance of the new method, and results of computer simulations are presented.

DOI
10.1109/tit.2017.2721423

Related papers

Error detection, correction and decoding

San Ling, Chaoping Xing

We saw in Chapter 1 that the purpose of channel coding is to introduce redundancy to information messages so that errors that occur in the transmission can be detected or even corrected. In this chapter, we formalize and discuss the notions of error-detection and error-correction. We also introduce some well known decoding rules, i.e., methods that retrieve the original message sent by detecting and correcting the errors that have occurred in the transmission. Communication channels We begin with some basic definitions. Definition 2.1.1 Let A = { a 1 , a 2 , …, a q } be a set of size q , which we refer to as a code alphabet and whose elements are called code symbols . (i) A q-ary word of length n over A is a sequence w = w 1 w 2 … w n with each w i ∈ A for all i . Equivalently, w may also be regarded as the vector ( w 1 , …, w n ). (ii) A q-ary block code of length n over A is a nonempty set C of q -ary words having the same length n . (iii) An element of C is called a codeword in C . (iv) The number of codewords in C , denoted by ∣ C ∣, is called the size of C . (v) The (information) rate of a code C of length n is defined to be (log q ∣ C ∣)/ n . (vi) A code of length n and size M is called an (n, M)-code .

Cambridge University Press eBooks•Feb 12, 2004•0 citations

Error-Control Coding Algorithms and Architecture for Modern Applications Powered by LDPC Codes and Belief Propagation

Prashnatita Pal, Bikash Chandra Sahana, Jayanta Poray +1 more

In modern data communication system Error Detection and Correction has great practical importance to maintain the data integrity across the noisy channel. To deal with this challenge, the theory of Error detection and correction need to get one's precise attention. To retrieve the original data, an efficient process is required. A class of error correcting codes which performs iterative decoding inside a graph is considered which can provide a good approximation. In this context Low Density Parity Check (LDPC) code comes with an excellent error correction performance. In this paper architecture and algorithms for Error Detection and Correction method based on LDPC code is proposed. Also, a simulator for the proposed algorithms is designed and tested successfully.

International Conference on Computing for Sustainable Global Development•Mar 23, 2022•2 citations

Quantum Error Correction Codes: A Dynamic Approach to Non-Uniform Encoding

Jincheng Zhang

This paper presents a novel approach to quantum error correction (QEC) utilizing non-uniform encoding. The core idea revolves around dynamically adapting the encoding scheme based on the redundancy of the data and the characteristics of the error distribution. Traditional uniform encoding methods often fail to optimize performance in scenarios with varying data properties. Our framework leverages performance analysis of QEC codes and adjusts parameters, such as code distance and block size, to achieve superior correction rates. We demonstrate that this dynamic approach significantly improves efficiency compared to static, uniform encoding, particularly when dealing with data exhibiting diverse redundancy and error profiles. The methodology outlined herein offers a flexible and powerful tool for maximizing the fidelity of quantum information transmission.

•Sep 5, 2026•0 citations

Classical and quantum error correcting code cnd a proposal applied in high school using the educational program scratch.

Debora Amanda Marquez

In this work, we present a mathematical approach to classical and quantum error-correcting codes. Error-correcting codes are a sort of codes used in the communication systems in order to detect and correct errors that occur during the data transmission or storage due to noise and signal distortion, aiming to recover the original transmitted information in an efficient and safe way. Such codes basically add redundancies to the data, so that the detection and correction of erros are possible. Finally, we present a proposal applied to high school involving code theory, using the educational program Scratch.

•Sep 5, 2023•0 citations

Performance Analysis of a CRC-aided BP Decoder in an AWGN Channel

Hamizan Suhaimi, Roslina Mohamad, Ezmin Abdullah +1 more

Polar codes have emerged as a powerful error correction technique for reliable data transmission in various communication systems. The addition of cyclic redundancy check (CRC) can significantly enhance the reliability of polar codes by providing an additional layer of error detection and correction. Without CRC, a system will lack a mechanism that detects and corrects decoding errors. By appending CRC bits to the polar-encoded data, the receiver with a belief propagation (BP) decoder can perform CRC to verify the correctness of the received information, enabling error detection beyond the capabilities of polar codes alone. This paper mainly focuses on incorporating CRC codes into polar codes and evaluating performance after the codes were transmitted into an additive white Gaussian channel. The CRC-aided BP decoder was simulated using MATLAB. The block length, N, was set to 256 and 1024 bits, and CRC varied between 12 and 16 bits for each N. The decoder system was tested with different numbers of iterations (50, 100, 200, and 500) to verify the performance in terms of bit error rate and frame error rate. Overall, this research provides a comprehensive analysis of the utilization of CRC for polar codes, considering different CRC sizes, numbers of iterations for BP decoding, and various block lengths. The average number of iterations of 200 and increasing CRC shows the lowest error rate readings throughout an increase in noise. The use of 12 and 16 bits of CRC further enhances the decoder’s error detection and correction capability.

IEEE Symposium on Computers & Informatics (ISCI)•Oct 14, 2023•1 citation

Using codes for error correction and detection (Corresp.)

Torleiv Kløve

A linear codeCover GF(q)is good fort-error-correction and error detection ifP(C,t;\epsilon) \leq P(C,t;(q - 1)/q)for all\epsilon, 0 \leq \epsilon \leq (q - 1)/q, whereP(C, t; \epsilon)is the probability of an undetected error after a codeword inCis transmitted over aq-ary symmetric channel with error probability\epsilonand correction is performed for all error patterns withtor fewer errors. A sufficient condition for a code to be good is derived. This sufficient condition is easy to check, and examples to illustrate the method are given.

IEEE Transactions on Information Theory•Nov 1, 1984•6 citations
We present composition check codes for noisy storage and transmission channels with unknown gain and/or offset. In the proposed composition check code, like in systematic error correcting codes, the encoding of the main data into a constant composition code is completely avoided. To the main data, a coded label is appended that carries information regarding the composition vector of the main data. Slepian's optimal detection technique of codewords that are taken from a constant composition code is applied for detection. A first Slepian detector detects the label and subsequently restores the composition vector of the main data. The composition vector, in turn, is used by a second Slepian detector to optimally detect the main data. We compute the redundancy and error performance of the new method, and results of computer simulations are presented.
We saw in Chapter 1 that the purpose of channel coding is to introduce redundancy to information messages so that errors that occur in the transmission can be detected or even corrected. In this chapter, we formalize and discuss the notions of error-detection and error-correction. We also introduce some well known decoding rules, i.e., methods that retrieve the original message sent by detecting and correcting the errors that have occurred in the transmission. Communication channels We begin with some basic definitions. Definition 2.1.1 Let A = { a 1 , a 2 , …, a q } be a set of size q , which we refer to as a code alphabet and whose elements are called code symbols . (i) A q-ary word of length n over A is a sequence w = w 1 w 2 … w n with each w i ∈ A for all i . Equivalently, w may also be regarded as the vector ( w 1 , …, w n ). (ii) A q-ary block code of length n over A is a nonempty set C of q -ary words having the same length n . (iii) An element of C is called a codeword in C . (iv) The number of codewords in C , denoted by ∣ C ∣, is called the size of C . (v) The (information) rate of a code C of length n is defined to be (log q ∣ C ∣)/ n . (vi) A code of length n and size M is called an (n, M)-code .
In modern data communication system Error Detection and Correction has great practical importance to maintain the data integrity across the noisy channel. To deal with this challenge, the theory of Error detection and correction need to get one's precise attention. To retrieve the original data, an efficient process is required. A class of error correcting codes which performs iterative decoding inside a graph is considered which can provide a good approximation. In this context Low Density Parity Check (LDPC) code comes with an excellent error correction performance. In this paper architecture and algorithms for Error Detection and Correction method based on LDPC code is proposed. Also, a simulator for the proposed algorithms is designed and tested successfully.
This paper presents a novel approach to quantum error correction (QEC) utilizing non-uniform encoding. The core idea revolves around dynamically adapting the encoding scheme based on the redundancy of the data and the characteristics of the error distribution. Traditional uniform encoding methods often fail to optimize performance in scenarios with varying data properties. Our framework leverages performance analysis of QEC codes and adjusts parameters, such as code distance and block size, to achieve superior correction rates. We demonstrate that this dynamic approach significantly improves efficiency compared to static, uniform encoding, particularly when dealing with data exhibiting diverse redundancy and error profiles. The methodology outlined herein offers a flexible and powerful tool for maximizing the fidelity of quantum information transmission.
In this work, we present a mathematical approach to classical and quantum error-correcting codes. Error-correcting codes are a sort of codes used in the communication systems in order to detect and correct errors that occur during the data transmission or storage due to noise and signal distortion, aiming to recover the original transmitted information in an efficient and safe way. Such codes basically add redundancies to the data, so that the detection and correction of erros are possible. Finally, we present a proposal applied to high school involving code theory, using the educational program Scratch.
Polar codes have emerged as a powerful error correction technique for reliable data transmission in various communication systems. The addition of cyclic redundancy check (CRC) can significantly enhance the reliability of polar codes by providing an additional layer of error detection and correction. Without CRC, a system will lack a mechanism that detects and corrects decoding errors. By appending CRC bits to the polar-encoded data, the receiver with a belief propagation (BP) decoder can perform CRC to verify the correctness of the received information, enabling error detection beyond the capabilities of polar codes alone. This paper mainly focuses on incorporating CRC codes into polar codes and evaluating performance after the codes were transmitted into an additive white Gaussian channel. The CRC-aided BP decoder was simulated using MATLAB. The block length, N, was set to 256 and 1024 bits, and CRC varied between 12 and 16 bits for each N. The decoder system was tested with different numbers of iterations (50, 100, 200, and 500) to verify the performance in terms of bit error rate and frame error rate. Overall, this research provides a comprehensive analysis of the utilization of CRC for polar codes, considering different CRC sizes, numbers of iterations for BP decoding, and various block lengths. The average number of iterations of 200 and increasing CRC shows the lowest error rate readings throughout an increase in noise. The use of 12 and 16 bits of CRC further enhances the decoder’s error detection and correction capability.
A linear codeCover GF(q)is good fort-error-correction and error detection ifP(C,t;\epsilon) \leq P(C,t;(q - 1)/q)for all\epsilon, 0 \leq \epsilon \leq (q - 1)/q, whereP(C, t; \epsilon)is the probability of an undetected error after a codeword inCis transmitted over aq-ary symmetric channel with error probability\epsilonand correction is performed for all error patterns withtor fewer errors. A sufficient condition for a code to be good is derived. This sufficient condition is easy to check, and examples to illustrate the method are given.