{"title":"重新审视单生成器拟阿贝尔码","authors":"Somphong Jitman, P. Udomkavanich","doi":"10.13069/jacodesmath.09585","DOIUrl":null,"url":null,"abstract":"The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two 1-generator quasi-abelian codes whose minimum distances are improved from Grassl’s online table are presented.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2016-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"One–generator quasi–abelian codes revisited\",\"authors\":\"Somphong Jitman, P. Udomkavanich\",\"doi\":\"10.13069/jacodesmath.09585\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two 1-generator quasi-abelian codes whose minimum distances are improved from Grassl’s online table are presented.\",\"PeriodicalId\":37029,\"journal\":{\"name\":\"Journal of Algebra Combinatorics Discrete Structures and Applications\",\"volume\":\"4 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebra Combinatorics Discrete Structures and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.13069/jacodesmath.09585\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebra Combinatorics Discrete Structures and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13069/jacodesmath.09585","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two 1-generator quasi-abelian codes whose minimum distances are improved from Grassl’s online table are presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
