{"title":"字段上LCD代码的边界和属性","authors":"S. Gannon, H. Kulosman","doi":"10.37418/jcsam.5.1.2","DOIUrl":null,"url":null,"abstract":"In 2020, Pang et al. defined binary $\\text{LCD}\\; [n,k]$ codes with biggest minimal distance, which meets the Griesmer bound [1]. We give a correction to and provide a different proof for [1, Theorem 4.2], provide a different proof for [1, Theorem 4.3], examine properties of LCD ternary codes, and extend some results found in [6] for any $q$ which is a power of an odd prime.","PeriodicalId":361024,"journal":{"name":"Journal of Computer Science and Applied Mathematics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"BOUNDS AND PROPERTIES OF LCD CODES OVER FIELDS\",\"authors\":\"S. Gannon, H. Kulosman\",\"doi\":\"10.37418/jcsam.5.1.2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 2020, Pang et al. defined binary $\\\\text{LCD}\\\\; [n,k]$ codes with biggest minimal distance, which meets the Griesmer bound [1]. We give a correction to and provide a different proof for [1, Theorem 4.2], provide a different proof for [1, Theorem 4.3], examine properties of LCD ternary codes, and extend some results found in [6] for any $q$ which is a power of an odd prime.\",\"PeriodicalId\":361024,\"journal\":{\"name\":\"Journal of Computer Science and Applied Mathematics\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer Science and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37418/jcsam.5.1.2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Science and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37418/jcsam.5.1.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In 2020, Pang et al. defined binary $\text{LCD}\; [n,k]$ codes with biggest minimal distance, which meets the Griesmer bound [1]. We give a correction to and provide a different proof for [1, Theorem 4.2], provide a different proof for [1, Theorem 4.3], examine properties of LCD ternary codes, and extend some results found in [6] for any $q$ which is a power of an odd prime.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
