Matrix Factorization over GF(2) and Trace-Orthogonal Bases of GF(2ⁿ )

DOI10.1137/0204014MaRDI QIDQ4096860zbMATH OpenOpenAlexFDO

Authors Abraham Lempel

Publication date 1975

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0204014

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(14)

• Binary frames with prescribed dot products and frame operator
• Hierarchies of resources for measurement-based quantum computation
• A class of doubly even self dual binary codes
• Parameters of Boolean functions generated by the most significant bits of linear recurrent sequences
• Some important results on \(\mathcal{T}\)-direct codes
• Some results on uniform arithmetic circuit complexity
• A coding scheme that increases the code rate
• What is odd about binary Parseval frames?
• Parametrization of self-dual codes by orthogonal matrices
• Some structural properties of low-rank matrices related to computational complexity
• A group algebra construction of binary even self dual codes
• Binary images of some self-dual codes over GF(2^ m) with respect to trace-orthogonal basis
• Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
• Optimal line packings from nonabelian groups

This page was built for publication: Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096860)