Research on Linear Codes Holding $q$-Ary $t$-Designs
Xinghao Wu, Junling Zhou

TL;DR
This paper investigates when linear codes support $q$-ary $t$-designs, develops new criteria for identifying such codes, and constructs examples including Reed-Solomon codes with explicitly determined parameters.
Contribution
It introduces two new criteria for linear codes to support $q$-ary $t$-designs and applies them to various code families, expanding understanding of design-supporting codes.
Findings
Several families of linear codes support $q$-ary 2-designs.
New criteria effectively identify $q$-ary $t$-designs in codes.
Explicit parameters are determined for certain $q$-ary 2-designs.
Abstract
A -ary - design is a collection of vectors of weight in with the property that every vector of weight in is contained in exactly members of . The supports of the vectors in a -ary -design form an ordinary -design, possibly with repeated blocks. While linear codes supporting ordinary combinatorial designs have been extensively studied, the case where codes hold -ary designs remains largely unexplored. This motivates a systematic investigation into whether codewords of a fixed weight in a linear code can form a -ary -design. Building on previous work, we develop two new criteria for this purpose. Applying these criteria, we show that several families of linear codes hold -ary -designs, including one- and two-weight codes, extremal self-dual codes, as well as…
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 · graph theory and CDMA systems · Finite Group Theory Research
