It is known (cf. Hamada, J. Combin. Inform. System Sci. 18 (1993b) that there is no ternary [78,6,51] code meeting the Griesmer bound and n 3(6; 51) = 79 or 80, where n3(k; d) denotes the smallest value of n for which there exists a ternary [n; k; d] code.
On the Nonexistence of Quaternary [51, 4, 37] Codes
โ Scribed by I. Landgev; T. Maruta; R. Hill
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 258 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we prove the nonexistence of quaternary linear codes with parameters [51,4, 37]. This result gives the exact value of n q (k, d) for q ฯญ 4, k ฯญ 4, d ฯญ 37 and 38. These were the only minimum distances for which the optimal length of a four-dimensional quaternary code was unknown. The proof is geometrical and relies heavily on results about the structure of certain sets of points in PG(2, 4).
๐ SIMILAR VOLUMES
It is unknown whether or not there exists a quaternary linear code with parameters [293, 5, 219], [289, 5, 216] or [277, 5, 207]. The purpose of this paper is to prove the nonexistence of quaternary linear codes with parameters [
The diophantine equation 2y t = 7 k + 1 is shown to have no solutions in integers for k > 2. Since this is a necessary condition for the existence of close-packed double Hamming-error-correcting codes on q = 7 symbols, there exist no such codes.
codes of type II and length 16 are known. In this note we relate the five optimal codes to the octacode. We also construct an optimal quaternary iso-dual [14, code which was not known previously.