{"title":"The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes","authors":"Lev Yohananov, Moshe Schwartz","doi":"arxiv-2409.10420","DOIUrl":null,"url":null,"abstract":"We completely determine the second covering radius for binary primitive\ndouble-error-correcting BCH codes. As part of this process, we provide a lower\nbound on the second covering radius for binary primitive BCH codes correcting\nmore than two errors.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"34 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.10420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We completely determine the second covering radius for binary primitive
double-error-correcting BCH codes. As part of this process, we provide a lower
bound on the second covering radius for binary primitive BCH codes correcting
more than two errors.