{"title":"On Boston bound for cyclic codes by DFT with unknown elements","authors":"Junru Zheng, T. Kaida","doi":"10.1109/iwsda.2009.5346404","DOIUrl":null,"url":null,"abstract":"The Boston bound is defined by the subset of defining set for cyclic codes. The authors proposed new simple derivation for the BCH bound, the HT bound and the shift bound, using the discrete Fourier transform (DFT) and the Blahut theorem. In this paper, we consider the Boston bound for cyclic codes by the DFT.","PeriodicalId":120760,"journal":{"name":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International Workshop on Signal Design and its Applications in Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iwsda.2009.5346404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The Boston bound is defined by the subset of defining set for cyclic codes. The authors proposed new simple derivation for the BCH bound, the HT bound and the shift bound, using the discrete Fourier transform (DFT) and the Blahut theorem. In this paper, we consider the Boston bound for cyclic codes by the DFT.