Lower bounds over codes correcting bursts with a given Lee weight or intensity
type: Item
instance of: scholarly article
title: Lower bounds over codes correcting bursts with a given Lee weight or intensity
zbMATH Open document ID: 0626.94011
DOI: 10.1016/0020-0255(86)90015-0
author: Gur Dial
published in: Information Sciences
publication date: 1986-01-01T00:00:00Z
review text: The burst error correcting and detecting capabilities of linear codes are considered. Two definitions of burst length are given. In the first, a burst of length b and Lee weight \(W_ L\) is a vector of Lee weight \(W_ L\) whose nonzero entries are confined to b consecutive positions, the first of which is nonzero. In the second a burst of length b and intensity a is a vector whose nonzero entries are confined to b consecutive positions, the first of which is nonzero and none of which has modular value exceeding a. Using combinatorial arguments, lower bounds are determined on the number of parity checks of linear codes capable of correcting bursts under the two definitions.
Mathematics Subject Classification ID: 94B20
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 4018937
zbMATH Keywords: burst correcting codes
zbMATH Keywords: Lee distance
zbMATH Keywords: burst length
zbMATH Keywords: Lee weight
zbMATH Keywords: number of parity checks
reviewed by: Ian Blake
MaRDI profile type: Publication
full work available at URL: 0020-0255(86)90015-0
OpenAlex ID: W2007129075
cites work: Principles of combinatorics
cites work: Q5665102
cites work: A note on bounds for burst correcting codes with Lee weight consideration
description: scientific article; zbMATH DE number 4018937