{"title":"具有最知名参数的恒循环码","authors":"Zekai Chen;Min Sha","doi":"10.1109/TIT.2026.3697372","DOIUrl":null,"url":null,"abstract":"In this paper, we construct several infinite families of <inline-formula> <tex-math>$q$ </tex-math></inline-formula>-ary constacyclic codes over a finite field <inline-formula> <tex-math>$\\mathbb {F}_{q}$ </tex-math></inline-formula> with length <inline-formula> <tex-math>$n$ </tex-math></inline-formula>, dimension around <inline-formula> <tex-math>$n/2$ </tex-math></inline-formula>, and minimum distance at least <inline-formula> <tex-math>$cn/\\log _{q} n$ </tex-math></inline-formula> for some positive constant <inline-formula> <tex-math>$c$ </tex-math></inline-formula>. They contain many constacyclic codes with optimal, or almost-optimal, or best-known parameters. We also consider constacyclic codes of various lengths.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"72 7","pages":"4837-4849"},"PeriodicalIF":2.6000,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constacyclic Codes With Best-Known Parameters\",\"authors\":\"Zekai Chen;Min Sha\",\"doi\":\"10.1109/TIT.2026.3697372\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we construct several infinite families of <inline-formula> <tex-math>$q$ </tex-math></inline-formula>-ary constacyclic codes over a finite field <inline-formula> <tex-math>$\\\\mathbb {F}_{q}$ </tex-math></inline-formula> with length <inline-formula> <tex-math>$n$ </tex-math></inline-formula>, dimension around <inline-formula> <tex-math>$n/2$ </tex-math></inline-formula>, and minimum distance at least <inline-formula> <tex-math>$cn/\\\\log _{q} n$ </tex-math></inline-formula> for some positive constant <inline-formula> <tex-math>$c$ </tex-math></inline-formula>. They contain many constacyclic codes with optimal, or almost-optimal, or best-known parameters. We also consider constacyclic codes of various lengths.\",\"PeriodicalId\":13494,\"journal\":{\"name\":\"IEEE Transactions on Information Theory\",\"volume\":\"72 7\",\"pages\":\"4837-4849\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2026-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11536062/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2026/3/27 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11536062/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/3/27 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
In this paper, we construct several infinite families of $q$ -ary constacyclic codes over a finite field $\mathbb {F}_{q}$ with length $n$ , dimension around $n/2$ , and minimum distance at least $cn/\log _{q} n$ for some positive constant $c$ . They contain many constacyclic codes with optimal, or almost-optimal, or best-known parameters. We also consider constacyclic codes of various lengths.
期刊介绍:
The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.