Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-25T02:21:07.746Z Has data issue: false hasContentIssue false

Some results concerning linear codes and (k, 3)-caps in three-dimensional Galois space

Published online by Cambridge University Press:  24 October 2008

Raymond Hill
Affiliation:
University of Salford

Abstract

The packing problem for (k, 3)-caps is that of finding (m, 3)r, q, the largest size of (k, 3)-cap in the Galois space Sr, q. The problem is tackled by exploiting the interplay of finite geometries with error-correcting codes. An improved general upper bound on (m, 3)3 q and the actual value of (m, 3)3, 4 are obtained. In terms of coding theory, the methods make a useful contribution to the difficult task of establishing the existence or non-existence of linear codes with certain weight distributions.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1978

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Barlotti, A.Sui (k, n)-archi di unpiano lineare finito. Boll. Un. Mat. Ital. (3), 11 (1956), 553556.Google Scholar
(2)Bramwell, D. L. and Wilson, B. J.Cubic caps in three dimensional Galois space. Proc. Royal Irish Acad., Sect. A 73 (1973), 279283.Google Scholar
(3)Hill, R.Caps and codes. Discrete Math. 22 (1978), 111137.CrossRefGoogle Scholar
(4)MacWilliams, F. J.A theorem on the distribution of weights in a systematic code. Bell System Tech. J. 42 (1963), 7994.CrossRefGoogle Scholar
(5)Lunelli, L. and Sce, M.Considerazioni arithmetiche e risultati sperimentali sui (k; n)q-archi. Lombardo Accad. Sci. Lett Rendic. 98 (1964), 352.Google Scholar
(6)Stein, E. and Retkin, H.On the symmetric (15; 3) arcs of the finite projective piane of order 7. Rend. Mat. e Appl. 24 fasc., 3–4 (1965), 392399.Google Scholar
(7)Thas, J. A.Some results concerning {(q + 1) (n − 1); n}-arcs and {(q + 1) (n − 1) + 1; n}-arcs in finite projective planes of order q. J. Combinational Theory Ser. A 19 (1975), 228232.CrossRefGoogle Scholar