Subfield Codes of Several Few-Weight Linear Codes Parametrized by Functions and Their Consequences
Li Xu, Cuiling Fan, Sihem Mesnager, Rong Luo, Haode Yan

TL;DR
This paper investigates subfield codes derived from six families of linear codes over finite fields, determining their parameters, weight distributions, and duals, with some codes being optimal or best known, and explores their applications in combinatorial designs.
Contribution
It introduces new classes of subfield codes parametrized by functions, explicitly determines their parameters and weight distributions, and links these codes to combinatorial t-designs.
Findings
Some codes are optimal and meet bounds.
The first family is an optimal two-weight code meeting the Griesmer bound.
Derived codes give rise to infinite families of t-designs.
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 -ary subfield codes of six different families of linear codes parametrized by two functions over a finite field are considered and studied, respectively. The parameters and (Hamming) weight distribution of and their punctured codes are explicitly determined. The parameters of the duals of these codes are also analyzed. Some of the resultant -ary codes 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 are also settled, among…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · Islamic Finance and Communication
