二进制循环码，即Z/sub - 4/-循环码

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.936039

J. Wolfmann

{"title":"二进制循环码，即Z/sub - 4/-循环码","authors":"J. Wolfmann","doi":"10.1109/ISIT.2001.936039","DOIUrl":null,"url":null,"abstract":"We determine all binary cyclic codes of length 2n with n odd which are Nechaev-Gray (1989, 1991) images of cyclic codes over Z/sub 4/ and we present several families of such codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Binary cyclic codes which are Z/sub 4/-cyclic codes\",\"authors\":\"J. Wolfmann\",\"doi\":\"10.1109/ISIT.2001.936039\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We determine all binary cyclic codes of length 2n with n odd which are Nechaev-Gray (1989, 1991) images of cyclic codes over Z/sub 4/ and we present several families of such codes.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.936039\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们确定了所有长度为2n且奇数为n的二进制循环码，它们是Z/sub 4/上循环码的Nechaev-Gray(1989, 1991)图像，并给出了这些码的几个族。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Binary cyclic codes which are Z/sub 4/-cyclic codes

We determine all binary cyclic codes of length 2n with n odd which are Nechaev-Gray (1989, 1991) images of cyclic codes over Z/sub 4/ and we present several families of such codes.

求助全文

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

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量

期刊最新文献

A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio The effect of redundancy on measurement Decision directed algorithms for multiuser detection A new modulation scheme using asymmetric error correcting code embedded in optical orthogonal code for optical CDMA Matrix CUSUM: a recursive multi-hypothesis change detection algorithm