Xueqin Jiang, M. Lee, Ram Prasad Paudel, TaeChol Shin
{"title":"广义Hadamard矩阵的码","authors":"Xueqin Jiang, M. Lee, Ram Prasad Paudel, TaeChol Shin","doi":"10.1109/ICSNC.2006.27","DOIUrl":null,"url":null,"abstract":"The Hadamard Matrices are widely used in communication systems, data compression, error control coding, cryptography, linear filtering and spectral analysis. Such a popularity of Hadamard matrices is explained by their simplicity and efficiency in a variety of concrete practical realizations. In this paper we consider a family {H_m}, m =1,2,.., of generalized Hadamard matrices of order p^m , where p is a prime number, and construct the corresponding family {C^*m} of generalized p-ary Hadamard codes which meet the Plotkin bound.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Codes From Generalized Hadamard Matrices\",\"authors\":\"Xueqin Jiang, M. Lee, Ram Prasad Paudel, TaeChol Shin\",\"doi\":\"10.1109/ICSNC.2006.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Hadamard Matrices are widely used in communication systems, data compression, error control coding, cryptography, linear filtering and spectral analysis. Such a popularity of Hadamard matrices is explained by their simplicity and efficiency in a variety of concrete practical realizations. In this paper we consider a family {H_m}, m =1,2,.., of generalized Hadamard matrices of order p^m , where p is a prime number, and construct the corresponding family {C^*m} of generalized p-ary Hadamard codes which meet the Plotkin bound.\",\"PeriodicalId\":217322,\"journal\":{\"name\":\"2006 International Conference on Systems and Networks Communications (ICSNC'06)\",\"volume\":\"49 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.27\",\"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.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
阿达玛矩阵广泛应用于通信系统、数据压缩、差错控制编码、密码学、线性滤波和频谱分析等领域。阿达玛矩阵如此受欢迎的原因是它在各种具体的实际实现中的简单性和高效性。本文考虑一族{H_m}， m =1,2，…对于p^m阶的广义Hadamard矩阵，其中p是素数，构造满足Plotkin界的广义p-ary Hadamard码族{C^*m}。
The Hadamard Matrices are widely used in communication systems, data compression, error control coding, cryptography, linear filtering and spectral analysis. Such a popularity of Hadamard matrices is explained by their simplicity and efficiency in a variety of concrete practical realizations. In this paper we consider a family {H_m}, m =1,2,.., of generalized Hadamard matrices of order p^m , where p is a prime number, and construct the corresponding family {C^*m} of generalized p-ary Hadamard codes which meet the Plotkin bound.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
