能量约束m阵列码的代数上界

[Proceedings] Singapore ICCS/ISITA `92 Pub Date : 1992-11-16 DOI:10.1109/ICCS.1992.255088

I. Yamada, K. Wattanawong, K. Kurosawa

{"title":"能量约束m阵列码的代数上界","authors":"I. Yamada, K. Wattanawong, K. Kurosawa","doi":"10.1109/ICCS.1992.255088","DOIUrl":null,"url":null,"abstract":"For block coded modulations, this paper gives an upper bound of the number of code words subject to the given minimum Euclidean distance and the given average energy. The result is applied to multi-level PSK and ASK signal sets. The bound is derived by generalizing Johnson's bound (1972) for binary constant weight codes.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"148 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algebraic upper bound of energy constrained M-array codes\",\"authors\":\"I. Yamada, K. Wattanawong, K. Kurosawa\",\"doi\":\"10.1109/ICCS.1992.255088\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For block coded modulations, this paper gives an upper bound of the number of code words subject to the given minimum Euclidean distance and the given average energy. The result is applied to multi-level PSK and ASK signal sets. The bound is derived by generalizing Johnson's bound (1972) for binary constant weight codes.<<ETX>>\",\"PeriodicalId\":223769,\"journal\":{\"name\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"volume\":\"148 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.1992.255088\",\"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] Singapore ICCS/ISITA `92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1992.255088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

对于分组编码调制，本文给出了在给定最小欧氏距离和给定平均能量条件下码字数的上界。结果应用于多级PSK和ASK信号集。该界是通过推广二进制等权码的Johnson界(1972)得到的。

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

查看原文本刊更多论文

Algebraic upper bound of energy constrained M-array codes

For block coded modulations, this paper gives an upper bound of the number of code words subject to the given minimum Euclidean distance and the given average energy. The result is applied to multi-level PSK and ASK signal sets. The bound is derived by generalizing Johnson's bound (1972) for binary constant weight codes.<>

求助全文

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

来源期刊

[Proceedings] Singapore ICCS/ISITA `92

自引率

0.00%

发文量