Abstract

It is shown that every symmetric matrix A, with entries from a finite field F, can be factored over F into $A = BB'$, where the number of columns of B is bounded from below by either the rank $\rho (A)$ of A, or by $1 + \rho (A)$, depending on A and on the characteristic of F This result is applied to show that every finite extension $\Phi $ of a finite field F has a trace-orthogonal basis over F. Necessary and sufficient conditions for the existence of a trace-orthonormal basis are also given. All proofs are constructive, and can be utilized to formulate procedures for minimal factorization and basis construction.

Keywords

  1. matrix factorization
  2. finite fields
  3. trace
  4. trace-orthogonal basis

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
Abraham Lempel, Matrix factorization over ${\rm GF}(2)$ and trace-orthogonal bases of ${\rm GF}(2\sp{n})$, SIAM J. Comput., 4 (1975), 175–186
2.
F. J. MacWilliams, N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977

Information & Authors

Information

Published In

cover image SIAM Journal on Computing
SIAM Journal on Computing
Pages: 758 - 767
ISSN (online): 1095-7111

History

Submitted: 13 May 1979
Accepted: 25 February 1980
Published online: 13 July 2006

Keywords

  1. matrix factorization
  2. finite fields
  3. trace
  4. trace-orthogonal basis

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

View Options

View options

PDF

View PDF

Figures

Tables

Media

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media