Classification of 3 mod 5 arcs in PG(3,5)

08/10/2021
by   Sascha Kurz, et al.
0

The proof of the non-existence of Griesmer [104, 4, 82]_5-codes is just one of many examples where extendability results are used. In a series of papers Landjev and Rousseva have introduced the concept of (tmod q)-arcs as a general framework for extendability results for codes and arcs. Here we complete the known partial classification of (3 mod 5)-arcs in PG(3,5) and uncover two missing, rather exceptional, examples disproving a conjecture of Landjev and Rousseva. As also the original non-existence proof of Griesmer [104, 4, 82]_5-codes is affected, we present an extended proof to fill this gap.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2023

A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes

In this paper, we completely determine the number of solutions to Tr^q^2...
research
02/04/2023

Bounds on Binary Niederreiter-Rosenbloom-Tsfasman LCD codes

Linear complementary dual codes (LCD codes) are codes whose intersection...
research
04/02/2019

New relations and separations of conjectures about incompleteness in the fnite domain

Our main results are in the following three sections: 1. We prove new ...
research
04/11/2020

On the existence of s-extremal singly even self-dual codes

We construct new s-extremal singly even self-dual codes of minimum weigh...
research
04/02/2019

New relations and separations of conjectures about incompleteness in the finite domain

Our main results are in the following three sections: 1. We prove new ...
research
07/06/2018

Design of Low-Complexity Convolutional Codes over GF(q)

This paper proposes a new family of recursive systematic convolutional c...

Please sign up or login with your details

Forgot password? Click here to reset