The non-existence of \((104,22;3,5)\)-arcs (Q326344): Difference between revisions

The main problem of coding theory is to find the minimal length \(n\), such that a code over a field of order \(q\) with dimension \(k\) and minimum distance \(d\) exists. This is denoted by \(n_q(k,d)\). Using the fact that the existence of a linear \([n,k,d]\) code over a field of order \(q\) is equivalent to the existence of a multiarc with parameters \((n,n-d)\) in \(\mathrm{PG}(k-1,q)\), the authors show that \(n_5(4,82)=105\) by proving the non-existence of a \((104,22)\) arc in \(\mathrm{PG}(3,5)\).