Work

Codes correcting and simultaneously detecting solid burst errors

Year: 2013

Type: article

Abstract: Detecting and correcting errors is one of the main tasks in coding theory. The bounds are important in terms of error-detecting and -correcting capabilities of the codes. Solid Burst error is common in several communication channels. This paper obtains lower and upper bounds on the number of parity-check digits required for linear codes capable of correcting any solid burst error of length b or less and simultaneously detecting any solid burst error of length s(>b) or less. Illustration of such a code is also provided.Keywords: Parity check matrix, Syndromes, Solid burst errors, Standard arrayDOI: 10.18495/comengapp.21.143150

Source: Computer Engineering and Applications Journal

DOI: 10.18495/comengapp.v2i1.15

Author: P.K. Das

Institution: University of Delhi

Language: English

Topic: Coding theory and cryptography

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W1900474072

FWCI: 0.874

Cites: 14

Cited by: 3

Related to: 10