含未知元的DFT循环码的波士顿界

2009 Fourth International Workshop on Signal Design and its Applications in Communications Pub Date : 1900-01-01 DOI:10.1109/iwsda.2009.5346404

Junru Zheng, T. Kaida

{"title":"含未知元的DFT循环码的波士顿界","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":"{\"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}","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

摘要

波士顿界是由循环码定义集的子集定义的。利用离散傅里叶变换(DFT)和Blahut定理，提出了BCH界、HT界和移位界的新的简单推导方法。本文用离散傅立叶变换来考虑循环码的波士顿界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On Boston bound for cyclic codes by DFT with unknown elements

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 Fourth International Workshop on Signal Design and its Applications in Communications

自引率

0.00%

发文量