{"title":"Codes equipped with non-cyclic burst-b distance, bounds and periodical burst errors","authors":"Pankaj Kumar Das, Achal Agarwal","doi":"10.1016/j.cam.2025.117081","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we present a study on codes equipped with non-cyclic burst-<span><math><mi>b</mi></math></span> distance. We mainly study bounds on the maximum number of codewords possible in such a code, as well as the codes’ periodical burst detection- and -correction capability. For such a code, we derive the Litsyn-Laihonen type of bound and its improved version. We also present the asymptotic form of Litsyn-Laihonen type bound and make a comparison with all the previously known asymptotic bounds. We also provide periodical burst detection- and -correction capability for such a code in general and then for a special code. Finally, we give a decoding procedure for the special code along with its computational complexity.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"476 ","pages":"Article 117081"},"PeriodicalIF":2.6000,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042725005953","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we present a study on codes equipped with non-cyclic burst- distance. We mainly study bounds on the maximum number of codewords possible in such a code, as well as the codes’ periodical burst detection- and -correction capability. For such a code, we derive the Litsyn-Laihonen type of bound and its improved version. We also present the asymptotic form of Litsyn-Laihonen type bound and make a comparison with all the previously known asymptotic bounds. We also provide periodical burst detection- and -correction capability for such a code in general and then for a special code. Finally, we give a decoding procedure for the special code along with its computational complexity.
期刊介绍:
The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest.
The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.