Hostname: page-component-54dcc4c588-m259h Total loading time: 0 Render date: 2025-09-12T11:24:40.984Z Has data issue: false hasContentIssue false
  • English
  • Français

Singleton arrays in coding theory

Published online by Cambridge University Press:  17 April 2009

Tatsuya Maruta ,
Isao Kikumasa  and
Hitoshi Kaneta
Tatsuya Maruta
Affiliation:
Department of Mathematics, Faculty of Science, Okayama University, Okayama 700, Japan
Isao Kikumasa
Affiliation:
Department of Mathematics, Faculty of Science, Okayama University, Okayama 700, Japan
Hitoshi Kaneta
Affiliation:
Department of Mathematics, Faculty of Science, Okayama University, Okayama 700, Japan
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We construct all Singleton arrays for the field GF(q) when q is odd. There exist φ(q − 1) arrays in this case.

Information

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 37 , Issue 3 , June 1988 , pp. 333 - 335
Copyright
Copyright © Australian Mathematical Society 1988

References

[1]Hirschfeld, J.W.P., Projective Geometry over Finite Fields (Oxford University Press, 1979).Google Scholar
[2]MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error Correcting Codes (North-Holland Amsterdam, 1977).Google Scholar
[3]Roth, R.M. and Seroussi, C., ‘On generator matrices of MDS codes’, IEEE Trans. Inform. Theor IT-31 (1985), 826–830.CrossRefGoogle Scholar
[4]Weyl, H., The Classical Groups (Princeton University Press, 1946).Google Scholar