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

Methods for constructing and decoding block error-correcting codes

Abdullah A. Hashim

Published Jan 1, 1974• 0 citations
OpenAlex

Related papers

Sequential Decoding Algorithms for Block Error-Correcting Codes

Yibin Ng, Wai Ho Mow

•Jan 1, 1998•0 citations

An improvement of insertion/deletion/substitution error correction capabilities of LDPC codes using slide decoding

Tooru Shigehiro, Hirohisa Yabe, Keiichi Iwamura

This study investigates insertion, deletion, and substitution error correcting codes constructed with low-density parity-check (LDPC) codes. The studies for insertion/deletion/substitution error correcting codes are few comparing with substitution error correcting codes. We improve insertion/deletion/substitution error correction capabilities of LDPC codes using slide decoding for modified check matrix. Our evaluation shows that the block error rate of the proposed method is lower than that of the conventional method using marker codes.

International Symposium on Information Theory and its Applications•Dec 1, 2012•0 citations

Decoding and synchronization of error correcting codes

S. A. Madkour

•Jan 1, 1983•0 citations

New decoding algorithm for a class of simple iterated codes–its application to decoding algorithm for reed‐muller codes

Kin‐ichiroh Tokiwa, Nasao Kasahara, Toshihiko Namekawa

Abstract Recently, for the improvement of reliability of digital communication systems, various kinds of error‐correcting codes are being used. to improve system reliability through the use of more capable error‐correcting codes it is extremely important to simplify the decoder construction and to reduce the decoding delay. This paper studies a decoding algorithm for a class of simple iterated codes (SI codes) constructed by simply repeating I times a codeword (called block) in a given code (called subcode). Moreover, this paper discusses the decoding delay when this decoding algorithm is applied to decoding the Reed‐Muller codes constructed by the superimposing method.

Electronics and Communications in Japan (Part I Communications)•Jan 1, 1984•0 citations

How to Mask in Error Correction Code Transformer: Systematic and Double Masking

Seong‐Joon Park, Kwak, Hee-Youl, Sang‐Hyo Kim +3 more

In communication and storage systems, error correction codes (ECCs) are pivotal in ensuring data reliability. As deep learning's applicability has broadened across diverse domains, there is a growing research focus on neural network-based decoders that outperform traditional decoding algorithms. Among these neural decoders, Error Correction Code Transformer (ECCT) has achieved the state-of-the-art performance, outperforming other methods by large margins. To further enhance the performance of ECCT, we propose two novel methods. First, leveraging the systematic encoding technique of ECCs, we introduce a new masking matrix for ECCT, aiming to improve the performance and reduce the computational complexity. Second, we propose a novel transformer architecture of ECCT called a double-masked ECCT. This architecture employs two different mask matrices in a parallel manner to learn more diverse features of the relationship between codeword bits in the masked self-attention blocks. Extensive simulation results show that the proposed double-masked ECCT outperforms the conventional ECCT, achieving the state-of-the-art decoding performance with significant margins.

arXiv:2308.08128•Aug 16, 2023•9 citations

Introduction to the theory of error-correcting codes

Ian F. Blake

Proceedings of the IEEE•Jul 1, 1984•30 citations
This study investigates insertion, deletion, and substitution error correcting codes constructed with low-density parity-check (LDPC) codes. The studies for insertion/deletion/substitution error correcting codes are few comparing with substitution error correcting codes. We improve insertion/deletion/substitution error correction capabilities of LDPC codes using slide decoding for modified check matrix. Our evaluation shows that the block error rate of the proposed method is lower than that of the conventional method using marker codes.
Abstract Recently, for the improvement of reliability of digital communication systems, various kinds of error‐correcting codes are being used. to improve system reliability through the use of more capable error‐correcting codes it is extremely important to simplify the decoder construction and to reduce the decoding delay. This paper studies a decoding algorithm for a class of simple iterated codes (SI codes) constructed by simply repeating I times a codeword (called block) in a given code (called subcode). Moreover, this paper discusses the decoding delay when this decoding algorithm is applied to decoding the Reed‐Muller codes constructed by the superimposing method.
In communication and storage systems, error correction codes (ECCs) are pivotal in ensuring data reliability. As deep learning's applicability has broadened across diverse domains, there is a growing research focus on neural network-based decoders that outperform traditional decoding algorithms. Among these neural decoders, Error Correction Code Transformer (ECCT) has achieved the state-of-the-art performance, outperforming other methods by large margins. To further enhance the performance of ECCT, we propose two novel methods. First, leveraging the systematic encoding technique of ECCs, we introduce a new masking matrix for ECCT, aiming to improve the performance and reduce the computational complexity. Second, we propose a novel transformer architecture of ECCT called a double-masked ECCT. This architecture employs two different mask matrices in a parallel manner to learn more diverse features of the relationship between codeword bits in the masked self-attention blocks. Extensive simulation results show that the proposed double-masked ECCT outperforms the conventional ECCT, achieving the state-of-the-art decoding performance with significant margins.