On the nonexistence of quaternary \([51, 4, 37]\) codes (Q1908798)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the nonexistence of quaternary \([51, 4, 37]\) codes |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the nonexistence of quaternary \([51, 4, 37]\) codes |
scientific article |
Statements
On the nonexistence of quaternary \([51, 4, 37]\) codes (English)
0 references
8 May 1996
0 references
The authors prove the nonexistence of quaternary linear \([51,4, 37]\)-codes. If \(n_q (k,d)\) denotes the minimum possible length of a \(q\)-ary linear code of dimension \(k\) and minimum distance \(d\), the values of \(n_4 (4,d)\) were known for all but two values of \(d\) [cf. \textit{P. P. Greenough} and \textit{R. Hill}, Discrete Math. 125, 187--199 (1994; Zbl 0792.94005) and \textit{R. Hill} and \textit{I. Landgev}, Inst. Math. Appl. Conf. Ser., New Ser. 59, 85--98 (1996; Zbl 0873.94021)]. The present paper solves the remaining two cases and shows \(n_4 (4, 37)= 52\) and \(n_4 (4, 38)= 53\). The proof is geometrical and uses results about certain point sets of \(\mathrm{PG}(2,4)\).
0 references
quaternary linear codes
0 references
projective plane
0 references
minimal code length
0 references