2010
DOI: 10.1142/s1793830910000553
|View full text |Cite
|
Sign up to set email alerts
|

Repeated Burst Error Locating Linear Codes

Abstract: This paper deals with derivation of bounds for linear codes that are able to detect and locate errors which occur during the process of transmission. The kind of errors considered are known as repeated burst errors. An illustration for such kind of a code has also been provided.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 6 publications
1
5
0
Order By: Relevance
“…Thus, the total number of linear combinations that h j can not be equal to is the sum of linear combinations in (4) and (8). At worst, all these combinations might yield a distinct sum.…”
Section: Bounds For Codes Correcting 2-repeated Burstsmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, the total number of linear combinations that h j can not be equal to is the sum of linear combinations in (4) and (8). At worst, all these combinations might yield a distinct sum.…”
Section: Bounds For Codes Correcting 2-repeated Burstsmentioning
confidence: 99%
“…Further, these results were extended to the codes correcting burst errors occurring within a subblock (refer Dass and Tyagi [5]). In our earlier paper [4] the authors obtained bounds over the number of parity-check digits required for codes detecting 2repeated and m-repeated bursts of length b or less occurring within a single subblock, the sub-block containing errors being identified. In this paper we extend our study to the correction of repeated bursts occurring within a sub-block.…”
Section: Introductionmentioning
confidence: 99%
“…This helps to make a balance in the efficiency of the channel. Many papers are written in this direction, e.g., [2,3,4,8,12].…”
Section: Introductionmentioning
confidence: 99%
“…Repeated burst error was introduced by Berardi, Dass and Verma in [1] and its general form was introduced by Dass and Verma in [5]. Repeated burst error affecting only single sub-block is studied by Dass and Madan in [7,8] where they obtain bounds for linear code correcting and locating such errors. In this correspondence, we study the situation when repeated burst errors are occurred in multiple sub-blocks and present bounds for linear codes which can detect, locate, also correct such errors, a parallel to the work done in [3].…”
Section: Introductionmentioning
confidence: 99%
“…With the appearance of the paper entitled "Error-Locating Codes-A New Concept in Error Control" by Wolf and Elspas [17], a new direction of research in coding theory has been opened up and many papers are written in this direction. Some of them may be mentioned as [1], [2], [4], [5], [12], [15], [16]. The paper [17] introduced the concept of error-locating codes (EL-codes)-which stands in between error detection and error correction concept.…”
Section: Introductionmentioning
confidence: 99%