Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2212.04799v1

Help | Advanced Search

Computer Science > Information Theory

arXiv:2212.04799v1 (cs)
[Submitted on 9 Dec 2022 (this version) , latest version 7 Mar 2023 (v2) ]

Title: The Subfield Codes of Some Few-Weight Linear Codes

Title: 某些少重量线性码的子域码

Authors:Li Xu, Cuiling Fan, Sihem Mesnager, Rong Luo
Abstract: Subfield codes of linear codes over finite fields have recently received a lot of attention, as some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, the $q$-ary subfield codes $\bar{C}_{f,g}^{(q)}$ of six different families of linear codes $\bar{C}_{f,g}$ are presented, respectively. The parameters and weight distribution of the subfield codes and their punctured codes $\bar{C}_{f,g}^{(q)}$ are explicitly determined. The parameters of the duals of these codes are also studied. Some of the resultant $q$-ary codes $\bar{C}_{f,g}^{(q)},$ $\bar{C}_{f,g}^{(q)}$ and their dual codes are optimal and some have the best known parameters. The parameters and weight enumerators of the first two families of linear codes $\bar{C}_{f,g}$ are also settled, among which the first family is an optimal two-weight linear code meeting the Griesmer bound, and the dual codes of these two families are almost MDS codes. As a byproduct of this paper, a family of $[2^{4m-2},2m+1,2^{4m-3}]$ quaternary Hermitian self-dual code are obtained with $m \geq 2$. As an application, several infinite families of 2-designs and 3-designs are also constructed with three families of linear codes of this paper.
Abstract: 子域码在有限域上的线性码最近引起了广泛关注,因为其中一些码是最佳的,并且在秘密共享、认证码和关联方案中有应用。 在本文中,分别介绍了六种不同线性码族$\bar{C}_{f,g}$的$q$-元子域码$\bar{C}_{f,g}^{(q)}$。 子域码及其删余码$\bar{C}_{f,g}^{(q)}$的参数和重量分布被明确确定。 这些码的对偶码的参数也进行了研究。 其中一些结果$q$-元码$\bar{C}_{f,g}^{(q)},$ $\bar{C}_{f,g}^{(q)}$ 以及它们的对偶码是最佳的,有些具有已知的最佳参数。 该论文中第一类和第二类线性码$\bar{C}_{f,g}$的参数和权重枚举也被确定,其中第一类是一个满足 Griesmer 界的最优两权线性码,这两类码的对偶码是几乎 MDS 码。 作为本文的一个副产品,得到了一类$[2^{4m-2},2m+1,2^{4m-3}]$四元 Hermitian 自正交码,其参数为$m \geq 2$。 作为应用,还利用本文的三类线性码构造了几类无限的 2 设计和 3 设计。
Comments: arXiv admin note: text overlap with arXiv:1804.06003, arXiv:2207.07262 by other authors
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2212.04799 [cs.IT]
  (or arXiv:2212.04799v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.04799
arXiv-issued DOI via DataCite

Submission history

From: Cuiling Fan [view email]
[v1] Fri, 9 Dec 2022 12:03:05 UTC (30 KB)
[v2] Tue, 7 Mar 2023 01:02:59 UTC (31 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号