Work

Linear codes on solid bursts and random errors

Year: 2015

Type: article

Abstract: The paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length $b$ or less and simultaneously any $e$ or less random errors. An example of such a code is also provided. Further, codes capable of detecting and simultaneously correcting such errors have also been dealt with.

Source: DOAJ (DOAJ: Directory of Open Access Journals)

Author: Pankaj Kumar 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: green

OpenAlex ID: W992945056

FWCI:

Cites: 16

Cited by:

Related to: 10