AAECC-3 Abstracts
Abstract
Recommendations
3-Nets realizing a group in a projective plane
In a projective plane $\mathit{PG}(2,\mathbb{K})$ defined over an algebraically closed field $\mathbb{K}$ of characteristic 0, we give a complete classification of 3-nets realizing a finite group. An infinite family, due to Yuzvinsky (Compos. Math. 140:1614---1624, 2004 ), arises from plane ...
Infinite families of 3-designs from special symmetric polynomials
AbstractTang and Ding (IEEE Trans Inf Theory 67(1):244–254, 2021) opened a new direction of searching for t-designs from elementary symmetric polynomials, which are used to construct the first infinite family of linear codes supporting 4-designs. In this ...
Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs
Interplay between coding theory and combinatorial <inline-formula> <tex-math notation="LaTeX">$t$ </tex-math></inline-formula>-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 75Total Downloads
- Downloads (Last 12 months)18
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in