重新审视单生成器拟阿贝尔码

Q3 Mathematics

Journal of Algebra Combinatorics Discrete Structures and Applications Pub Date : 2016-02-07 DOI:10.13069/jacodesmath.09585

Somphong Jitman, P. Udomkavanich

{"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}

引用次数: 0

摘要

重新讨论了有限域上的一类1-生成拟阿贝尔码。给出了这种代码的可选和明确的表征和枚举。给出了一种求出所有1-生成器拟阿贝尔码的算法。给出了两个1-生成器拟阿贝尔码，它们的最小距离是对Grassl在线表的改进。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

One–generator quasi–abelian codes revisited

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Algebra Combinatorics Discrete Structures and Applications Mathematics-Algebra and Number Theory

CiteScore

0.90

自引率

0.00%

发文量

审稿时长

5 weeks