z4 -线性类目标码的代数译码

IEEE Trans. Inf. Theory Pub Date : 2000-09-01 DOI:10.1109/18.868490

K. Ranto

{"title":"z4 -线性类目标码的代数译码","authors":"K. Ranto","doi":"10.1109/18.868490","DOIUrl":null,"url":null,"abstract":"The Z/sub 4/-linear Goethals-like code of length 2/sup m/ has 2/sup 2m+1-3m-2/ codewords and minimum Lee distance 8 for any odd integer m/spl ges/3. We present an algebraic decoding algorithm for all Z/sub 4/-linear Goethals-like codes C/sub k/ introduced by Helleseth et al.(1995, 1996). We use Dickson polynomials and their properties to solve the syndrome equations.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"42 1","pages":"2193-2197"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"On algebraic decoding of the Z4-linear Goethals-like codes\",\"authors\":\"K. Ranto\",\"doi\":\"10.1109/18.868490\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Z/sub 4/-linear Goethals-like code of length 2/sup m/ has 2/sup 2m+1-3m-2/ codewords and minimum Lee distance 8 for any odd integer m/spl ges/3. We present an algebraic decoding algorithm for all Z/sub 4/-linear Goethals-like codes C/sub k/ introduced by Helleseth et al.(1995, 1996). We use Dickson polynomials and their properties to solve the syndrome equations.\",\"PeriodicalId\":13250,\"journal\":{\"name\":\"IEEE Trans. Inf. Theory\",\"volume\":\"42 1\",\"pages\":\"2193-2197\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Trans. Inf. Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/18.868490\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Trans. Inf. Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/18.868490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

长度为2/sup m/的Z/ sub4 /-线性类goethals码具有2/sup 2m+1-3m-2/码字，对于任意奇数m/spl ges/3，最小李距离为8。我们提出了一种代数解码算法，适用于Helleseth等人(1995,1996)引入的所有Z/sub - 4/-线性类goethals码C/sub - k/。我们利用Dickson多项式及其性质来求解方程组。

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

查看原文本刊更多论文

On algebraic decoding of the Z4-linear Goethals-like codes

The Z/sub 4/-linear Goethals-like code of length 2/sup m/ has 2/sup 2m+1-3m-2/ codewords and minimum Lee distance 8 for any odd integer m/spl ges/3. We present an algebraic decoding algorithm for all Z/sub 4/-linear Goethals-like codes C/sub k/ introduced by Helleseth et al.(1995, 1996). We use Dickson polynomials and their properties to solve the syndrome equations.

求助全文

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

来源期刊

IEEE Trans. Inf. Theory

自引率

0.00%

发文量