This paper describes a new method of QR-decomposition of square nonsingular matrices (real or complex) by the Givens rotations through the unitary discrete heap transforms. This transforms can be ...
Abstract: In this paper, we propose a new encoding algorithm for linear codes whose computational complexity is O(w(H)) where w(H) denotes the number of non-zero elements in a parity check matrix H of ...
This paper describes a new method of QR-decomposition of square nonsingular matrices (real or complex) by the Givens rotations through the unitary discrete heap transforms. This transforms can be ...
Structural decomposition of sparse matrices into block upper-triangular form using graph algorithms. is block upper-triangular, where each diagonal block corresponds to a strongly connected component ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results