{"title":"(T, U)映射矩阵:性质及其在置换译码中的应用","authors":"Ming-ru Jia, A. Benyamin-Seeyar, T. Le-Ngoc","doi":"10.1109/ISIT.1994.394887","DOIUrl":null,"url":null,"abstract":"Properties of mapping matrices which define the connection of the /spl gamma/-type error patterns in different domains are presented. Using their properties, we can define the capability of the s-step (T, U) permutation decoding method. These properties can also be extended to other permutation decoding methods which use the elements other than p (the characteristic of GF(q)) as multipliers.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"85 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"(T, U) mapping matrices: properties and applications in permutation decoding\",\"authors\":\"Ming-ru Jia, A. Benyamin-Seeyar, T. Le-Ngoc\",\"doi\":\"10.1109/ISIT.1994.394887\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Properties of mapping matrices which define the connection of the /spl gamma/-type error patterns in different domains are presented. Using their properties, we can define the capability of the s-step (T, U) permutation decoding method. These properties can also be extended to other permutation decoding methods which use the elements other than p (the characteristic of GF(q)) as multipliers.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"85 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394887\",\"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 of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394887","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
(T, U) mapping matrices: properties and applications in permutation decoding
Properties of mapping matrices which define the connection of the /spl gamma/-type error patterns in different domains are presented. Using their properties, we can define the capability of the s-step (T, U) permutation decoding method. These properties can also be extended to other permutation decoding methods which use the elements other than p (the characteristic of GF(q)) as multipliers.<>