Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
From MaRDI portal
Publication:4096860
DOI10.1137/0204014zbMath0331.94006OpenAlexW2056829476MaRDI QIDQ4096860
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
Matrices over special rings (quaternions, finite fields, etc.) (15B33) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (14)
Parametrization of self-dual codes by orthogonal matrices ⋮ A group algebra construction of binary even self dual codes ⋮ Some results on uniform arithmetic circuit complexity ⋮ What is odd about binary Parseval frames? ⋮ Binary frames with prescribed dot products and frame operator ⋮ Hierarchies of resources for measurement-based quantum computation ⋮ Binary images of some self-dual codes over GF(\(2^ m)\) with respect to trace-orthogonal basis ⋮ Some structural properties of low-rank matrices related to computational complexity ⋮ 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 ⋮ A coding scheme that increases the code rate ⋮ Параметры булевых функций, построенных с использованием старших координатных последовательностей линейных рекуррент ⋮ Some important results on 𝒯-Direct codes ⋮ A class of doubly even self dual binary codes
This page was built for publication: Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
