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.04799v2

Help | Advanced Search

Computer Science > Information Theory

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

Title: Subfield Codes of Several Few-Weight Linear Codes Parametrized by Functions and Their Consequences

Title: 由函数参数化的几个低权重线性码的子域码及其后果

Authors:Li Xu, Cuiling Fan, Sihem Mesnager, Rong Luo, Haode Yan
Abstract: Subfield codes of linear codes over finite fields have recently received much attention. 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 $C_{f,g}^{(q)}$ of six different families of linear codes $C_{f,g}$ parametrized by two functions $f, g$ over a finite field $F_{q^m}$ are considered and studied, respectively. The parameters and (Hamming) weight distribution of $C_{f,g}^{(q)}$ and their punctured codes $\bar{C}_{f,g}^{(q)}$ are explicitly determined. The parameters of the duals of these codes are also analyzed. Some of the resultant $q$-ary codes $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 $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, we show that three families of the derived linear codes give rise to several infinite families of $t$-designs ($t \in \{2, 3\}$).
Abstract: Subfield codes of linear codes over finite fields have recently received much attention. 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 $C_{f,g}^{(q)}$ of six different families of linear codes $C_{f,g}$ parametrized by two functions $f, g$ over a finite field $F_{q^m}$ are considered and studied, respectively. The parameters and (Hamming) weight distribution of $C_{f,g}^{(q)}$ and their punctured codes $\bar{C}_{f,g}^{(q)}$ are explicitly determined. The parameters of the duals of these codes are also analyzed. 一些结果的$q$-元码$C_{f,g}^{(q)},$ $\bar{C}_{f,g}^{(q)}$ 及其对偶码是最佳的,有些具有最好的已知参数。线性码$C_{f,g}$的前两族的参数和重量枚举也被确定,其中第一族是一个满足 Griesmer 界的最佳二重量线性码,这两族的对偶码是几乎 MDS 码。作为本文的副产品,获得了一族$[2^{4m-2},2m+1,2^{4m-3}]$四元 Hermitian 自对偶码,其具有$m \geq 2$。 作为应用,我们证明了三个导出线性码族可以产生若干无限族的$t$-设计 ($t \in \{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.04799v2 [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号