Abstract
In this paper we solve two instances of the main problem in coding theory for linear codes of dimension 5 over $\mathbb{F}_4$. We prove the nonexistence of $[395,5,295]_4$- and $[396,5,296]_4$-codes which implies the exact values $n_4(5,295)=396$ and $n_4(5,296)=397$. As a by-product, we characterize the arcs with parameters $(100,26)$ in $PG(3,4)$.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Annual of Sofia University St. Kliment Ohridski. Faculty of Mathematics and Informatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
