Dense matrices over \(\mathbb{F}_{2^e}\) represented as slices of matrices over \(\mathbb{F}_2\). More...
#include <mzd_slice.h>
Data Fields | |
mzd_t * | x [16] |
rci_t | nrows |
rci_t | ncols |
unsigned int | depth |
const gf2e * | finite_field |
Dense matrices over \(\mathbb{F}_{2^e}\) represented as slices of matrices over \(\mathbb{F}_2\).
This is one of two fundamental data types of this library, the other being mzed_t. For large matrices ( \(m \times n \times e > L2\)) it is advisable to use this data type because multiplication is faster in this representation. Hence, compared to mzed_t one saves the time to convert betwen representations and - more importantly - memory.
unsigned int mzd_slice_t::depth |
Number of slices *
const gf2e* mzd_slice_t::finite_field |
A finite field \(\mathbb{F}_{2^e}\).
rci_t mzd_slice_t::ncols |
Number of columns.
rci_t mzd_slice_t::nrows |
Number of rows.
mzd_t* mzd_slice_t::x[16] |
mzd_slice_t::x[e][i,j] is the \(e\)-th bit of the entry A[i,j].