{"title":"[1,0]扭曲的广义里德-所罗门码","authors":"Canze Zhu, Qunying Liao","doi":"10.1007/s12095-024-00704-3","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we not only give the parity check matrix of the [1, 0]-twisted generalized Reed-Solomon (in short, TGRS) code, but also determine the weight distribution. Especially, we show that the [1, 0]-TGRS code is not GRS or EGRS. Furthermore, we present a sufficient and necessary condition for any punctured code of the [1, 0]-TGRS code to be self-orthogonal, and then construct several classes of self-dual or almost self-dual [1, 0]-TGRS codes. Finally, on the basis of these self-dual or almost self-dual [1, 0]-TGRS codes, we obtain some LCD [1, 0]-TGRS codes.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"36 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The [1, 0]-twisted generalized Reed-Solomon code\",\"authors\":\"Canze Zhu, Qunying Liao\",\"doi\":\"10.1007/s12095-024-00704-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we not only give the parity check matrix of the [1, 0]-twisted generalized Reed-Solomon (in short, TGRS) code, but also determine the weight distribution. Especially, we show that the [1, 0]-TGRS code is not GRS or EGRS. Furthermore, we present a sufficient and necessary condition for any punctured code of the [1, 0]-TGRS code to be self-orthogonal, and then construct several classes of self-dual or almost self-dual [1, 0]-TGRS codes. Finally, on the basis of these self-dual or almost self-dual [1, 0]-TGRS codes, we obtain some LCD [1, 0]-TGRS codes.</p>\",\"PeriodicalId\":10788,\"journal\":{\"name\":\"Cryptography and Communications\",\"volume\":\"36 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cryptography and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s12095-024-00704-3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptography and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s12095-024-00704-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we not only give the parity check matrix of the [1, 0]-twisted generalized Reed-Solomon (in short, TGRS) code, but also determine the weight distribution. Especially, we show that the [1, 0]-TGRS code is not GRS or EGRS. Furthermore, we present a sufficient and necessary condition for any punctured code of the [1, 0]-TGRS code to be self-orthogonal, and then construct several classes of self-dual or almost self-dual [1, 0]-TGRS codes. Finally, on the basis of these self-dual or almost self-dual [1, 0]-TGRS codes, we obtain some LCD [1, 0]-TGRS codes.