BOUNDS FOR CODES CORRECTING/DETECTING REPEATED LOW-DENSITY BURST ERRORS-Reference-Cited by-同舟云学术

BOUNDS FOR CODES CORRECTING/DETECTING REPEATED LOW-DENSITY BURST ERRORS

Published:2012-12 Issue:04 Volume:04 Page:1250048
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

DASS BAL KISHAN¹,GARG POONAM²

Affiliation:

1. Department of Mathematics, University of Delhi, Delhi - 110 007, India

2. Department of Mathematics, Deen Dayal Upadhyaya College, (University of Delhi), Shivaji Marg, Karam Pura, New Delhi - 110 015, India

Abstract

This paper presents lower bound on the number of parity-check digits required for linear codes that correct m-repeated low-density burst errors of length b (fixed) with weight w or less (w ≤ b). An upper bound on the number of parity-check digits required for linear codes that are capable of detecting such m-repeated low-density bursts has also been derived.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830912500486

Reference15 articles.

1. A class of systematic codes for non-independent errors

2. Capabilities of the Telephone Network for Data Transmission

3. On Definitions of a Burst

4. A Sufficient Bound for Codes Correcting Bursts with Weight Constraint

5. Brief communication

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Low-density periodical burst correcting codes with decoding probability and detection capability;Journal of Applied Mathematics and Computing;2022-03-07

2. Periodical Burst Error Correcting Codes With Decoding Error Probability;Discrete Mathematics Letters;2021-10-27