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

STATISTICAL MECHANICS APPROACH TO ERROR-CORRECTING CODES

Nicolas Sourlas

Solvay Conference on Physics•Aug 1, 2003•2 citations

ERROR DETECTION CAPABILITY OF SHORTENED HAMMING CODES AND THEIR DUAL CODES

夏树涛, 符方伟

Acta Mathematicae Applicatae Sinica English Series•Jan 1, 2000•0 citations

On the probability of undetected error of linear block codes

Tadao Kasami, Shu Lin, Torleiv Kløve

•Jan 1, 1982•4 citations

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

Bounds On The Error Probability For Random Codes

Gunnar Hedby

IEEE International Symposium on Information Theory (ISIT)•Aug 24, 2005•0 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