Codes equipped with non-cyclic burst-b distance, bounds and periodical burst errors

IF 2.6 2区 数学 Q1 MATHEMATICS, APPLIED
Pankaj Kumar Das, Achal Agarwal
{"title":"Codes equipped with non-cyclic burst-b distance, bounds and periodical burst errors","authors":"Pankaj Kumar Das,&nbsp;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-b 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.
编码具有非循环突发距离、边界和周期性突发误差
本文研究了具有非循环突发b距离的码。我们主要研究了这种码的最大码字数,以及这种码的周期性突发检测和纠错能力。对于这样的代码,我们导出了界的Litsyn-Laihonen类型及其改进版本。给出了Litsyn-Laihonen型界的渐近形式,并与所有已知的渐近界作了比较。我们还提供定期突发检测和纠正能力,一般这样的代码,然后为特殊代码。最后给出了特殊码的译码过程及其计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
5.40
自引率
4.20%
发文量
437
审稿时长
3.0 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信