Nadya Markin

Iterated Space-Time Code Constructions From Cyclic Algebras

We propose a full-rate iterative space-time code construction, which uses an algebraic space-time code in order to design a new space-time code of double the code rank. We give a condition for determining whether the resulting codes satisfy the full diversity property, and study their maximum likelihood decoding complexity with respect to sphere decoding. Particular emphasis is given to the asymmetric multiple input double output codes. In the process, we derive an interesting way of obtaining division algebras, and study their centers and maximal subfields.

Quadratic Forms and Space-Time Block Codes From Generalized Quaternion and Biquaternion Algebras

In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic criteria to check if such algebras are division algebras. For base fields relevant to STBCs, these criteria are exploited, via Springers theorem, to construct several explicit infinite families of (bi-)quaternion division algebras. These are used to obtain new 2 × 2 and 4 × 4 STBCs.

ON ABELIAN GROUP REPRESENTABILITY OF FINITE GROUPS

A set of quasi-uniform random variables

Iterated MIDO space-time code constructions

X_1,...,X_n

Groups and information inequalities in 5 variables

may be generated from a finite group

Bounds on Fast Decodability of Space-Time Block Codes, Skew-Hermitian Matrices, and Azumaya Algebras

G

Fast lattice decodability of space-time block codes

and

A class of iterated fast decodable space-time codes for 2 n Tx antennas

n

Algebraic fast-decodable relay codes for distributed communications

of its subgroups, with the corresponding entropic vector depending on the subgroup structure of

Fast decodable codes for 6Tx-3Rx MIMO systems

G