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

ON THE PROBABILITY OF UNDETECTED ERROR FOR ITERATED CODES

Osamu Nagata, Ra S Awas

Published Jan 1, 1983• 0 citations
OpenAlex

Related papers

COMPARISON OF THE CURVES OF THE DEPENDENCE OF THE PROBABILITY OF BIT ERROR ON THE SIGNAL-TO-NOISE RATIO OF HAMMING CODES AND REED-MULLER CODES BASED ON THEM

A.A. Zakharkin, Aleksei Ovinnikov

The paper presents a comparison of the noise immunity curves of a number of Hemming codes and extended Hemming codes, which are Reed-Muller codes. A brief description of the latest codes is provided, as well as conclusions on the work.

Modern Technologies in Science and Education (MTSE)•Jun 15, 2025•0 citations

On the probability of undetected error of linear block codes

Tadao Kasami, Shu Lin, Torleiv Kløve

•Jan 1, 1982•4 citations

QUANTUM CODES FROM CYCLIC CODES OVER FINITE RING

Jianfa Qian, Wenping Ma, Wangmei Guo

A new method to obtain self-orthogonal codes over finite field F2 is presented. Based on this method, we provide a construction for quantum error-correcting codes starting from cyclic codes over finite ring R = F2 + uF2. As an example, we present infinite families of quantum error-correcting codes which are derived from cyclic codes over the ring R = F2 + uF2.

International Journal of Quantum Information•Sep 1, 2009•90 citations

Bounds On The Error Probability For Random Codes

Gunnar Hedby

IEEE International Symposium on Information Theory (ISIT)•Aug 24, 2005•0 citations

ELIMINATING UNDETECTED ERRORS IN LDPC–CPM DECODERS

Erik S. Perrins

In error control coding, an undetected error occurs when the received code word passes the parity check even though errors are present. Such errors are a critical concern in many applications because a passed parity check at the receiver is taken to mean that the received code word is error free. In this paper, we outline the key operating principles and differences between the two constituent decoders in the system. Our high-level discussion reveals insights on two strategies that can be used in an LDPC–CPM decoder to eliminate undetected errors. The first is a brute-force approach of performing an additional decoding iteration to confirm (or rebut) a passed parity check. The second is a simple and elegant check-node-splitting approach that can be incorporated into the LDPC code itself. We provide numerical results and operating scenarios where these techniques are recommended for use.

•Oct 1, 2025•0 citations

On the Probability of Incorrect Decoding for Linear Codes

Marco Frego

Lecture notes in computer science•Jan 1, 2017•3 citations
In error control coding, an undetected error occurs when the received code word passes the parity check even though errors are present. Such errors are a critical concern in many applications because a passed parity check at the receiver is taken to mean that the received code word is error free. In this paper, we outline the key operating principles and differences between the two constituent decoders in the system. Our high-level discussion reveals insights on two strategies that can be used in an LDPC–CPM decoder to eliminate undetected errors. The first is a brute-force approach of performing an additional decoding iteration to confirm (or rebut) a passed parity check. The second is a simple and elegant check-node-splitting approach that can be incorporated into the LDPC code itself. We provide numerical results and operating scenarios where these techniques are recommended for use.