修正Hadamard矩阵的三进制码

2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI:10.1109/ICSNC.2006.69

Xueqin Jiang, M. Lee, Sergey A. Stepanov, KwangJe Lee, KimSung Hun

{"title":"修正Hadamard矩阵的三进制码","authors":"Xueqin Jiang, M. Lee, Sergey A. Stepanov, KwangJe Lee, KimSung Hun","doi":"10.1109/ICSNC.2006.69","DOIUrl":null,"url":null,"abstract":"In this paper we construct two families C*m and C*m of ternary (2^m ,3^m ,2^m-1) and (2^m ,3^m+1,2^m-1) codes, for m =1,2,3,.., derived from the corresponding families of modified ternary Hadamard matrices. These codes are close to the Plotkin bound and have a very easy decoding procedure.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ternary Codes From Modified Hadamard Matrices\",\"authors\":\"Xueqin Jiang, M. Lee, Sergey A. Stepanov, KwangJe Lee, KimSung Hun\",\"doi\":\"10.1109/ICSNC.2006.69\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we construct two families C*m and C*m of ternary (2^m ,3^m ,2^m-1) and (2^m ,3^m+1,2^m-1) codes, for m =1,2,3,.., derived from the corresponding families of modified ternary Hadamard matrices. These codes are close to the Plotkin bound and have a very easy decoding procedure.\",\"PeriodicalId\":217322,\"journal\":{\"name\":\"2006 International Conference on Systems and Networks Communications (ICSNC'06)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Systems and Networks Communications (ICSNC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSNC.2006.69\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSNC.2006.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文构造了三进制(2^m,3^m,2^m-1)和(2^m,3^m+1,2^m-1)码的两个族C*m和C*m，对于m =1,2,3，…，由相应的修正三元Hadamard矩阵族推导而来。这些代码接近普洛特金界，解码过程非常简单。

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

查看原文本刊更多论文

Ternary Codes From Modified Hadamard Matrices

In this paper we construct two families C*m and C*m of ternary (2^m ,3^m ,2^m-1) and (2^m ,3^m+1,2^m-1) codes, for m =1,2,3,.., derived from the corresponding families of modified ternary Hadamard matrices. These codes are close to the Plotkin bound and have a very easy decoding procedure.

求助全文

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

来源期刊

2006 International Conference on Systems and Networks Communications (ICSNC'06)

自引率

0.00%

发文量