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

Journal of Cybernetics

LINEAR CODES HAVING A SUB-BLOCK STRUCTURE

Sat Narain Gupta, Anusha Malhotra

Published Jul 1, 1976• 1 citation
Publisher

Abstract

Linear codes having a sub-block structure are discussed. A substitute method of constructing codes capable of detecting and correcting combinations of error patterns in various sub-blocks is given. Codes where error-correction capabilities are determined in terms of various sub-blocks of the word length are introduced.
DOI
10.1080/01969727608927536

Related papers

Necessary and sufficient conditions on block codes correcting/detecting errors of various types

Jos H. Weber, Cornelis de Vroedt, Dick E. Boekee

Necessary and sufficient conditions are given for block codes to be capable of correcting up to t/sub 1/ symmetric errors, up to t/sub 2/ unidirectional errors, and up to t/sub 3/ asymmetric errors, as well as detecting from t/sub 1/+1 up to d/sub 1/ symmetric errors that are not of the unidirectional type, from t/sub 2/+1 up to d/sub 2/ unidirectional errors that are not of the asymmetric type, and from t/sub 3/+1 up to d/sub 3/ asymmetric errors. Many known conditions on block codes concerning error correction and/or detection appear as special cases of this general result. Further, some codes turn out to have stronger error correcting/detection capabilities than they were originally designed for.>

IEEE Transactions on Computers•Jan 1, 1992•18 citations

Error Correcting Ability of Linear Block Codes

辰一 小島

群馬大学教育学部紀要. 自然科学編•Jan 1, 1989•0 citations

Methods for constructing and decoding block error-correcting codes

Abdullah A. Hashim

•Jan 1, 1974•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

Burst Detection and Correction for Gilbert Codes and its QC-LDPC Extensions

Вересова Алина Максимовна, Andrei A. Ovchinnikov

The article discusses the issue of determining the location of an error burst based on the structure of a block-permutation low-density parity-check code. Quasi-cyclic low-density parity-check codes with a small number of blocks are considered, making it possible to correct the longest possible bursts within this construction. Through experimentation, the maximum, minimum, and average number of attempts was estimated when determining the start position of the error burst. The features of determining the location of a packet in block-permutation low-density parity-check codes are revealed. The proposed method is based on using majority decoding techniques and allows reducing the average number of attempts to locate a burst from hundreds to units for the codes under consideration. Using the packet detection method, which is based on the analysis of the structure of the parity-check matrix, algorithms for decoding Gilbert and extended Gilbert codes have been proposed, ensuring the correction of bursts within their error-correction capabilities. The process of decoding extended Gilbert codes utilizes list decoding in a supercode, with a criterion for selecting the error vector based on the syndrome.

International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)•Sep 30, 2024•2 citations

Linear block codes for error detection

Rossitza Dodunekova, S.M. Dodunekov

•Jan 1, 1996•2 citations
Necessary and sufficient conditions are given for block codes to be capable of correcting up to t/sub 1/ symmetric errors, up to t/sub 2/ unidirectional errors, and up to t/sub 3/ asymmetric errors, as well as detecting from t/sub 1/+1 up to d/sub 1/ symmetric errors that are not of the unidirectional type, from t/sub 2/+1 up to d/sub 2/ unidirectional errors that are not of the asymmetric type, and from t/sub 3/+1 up to d/sub 3/ asymmetric errors. Many known conditions on block codes concerning error correction and/or detection appear as special cases of this general result. Further, some codes turn out to have stronger error correcting/detection capabilities than they were originally designed for.>
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.
The article discusses the issue of determining the location of an error burst based on the structure of a block-permutation low-density parity-check code. Quasi-cyclic low-density parity-check codes with a small number of blocks are considered, making it possible to correct the longest possible bursts within this construction. Through experimentation, the maximum, minimum, and average number of attempts was estimated when determining the start position of the error burst. The features of determining the location of a packet in block-permutation low-density parity-check codes are revealed. The proposed method is based on using majority decoding techniques and allows reducing the average number of attempts to locate a burst from hundreds to units for the codes under consideration. Using the packet detection method, which is based on the analysis of the structure of the parity-check matrix, algorithms for decoding Gilbert and extended Gilbert codes have been proposed, ensuring the correction of bursts within their error-correction capabilities. The process of decoding extended Gilbert codes utilizes list decoding in a supercode, with a criterion for selecting the error vector based on the syndrome.