We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field Q embedded in matrix rings. The first half of the paper deals with constructions using field extensions of Q. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we co...
Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission chann...
Abstract — Viewing an n length vector over Fqm as an m × n matrix over Fq, by expanding each entry o...
Viewing an n-length vector over $F_{q^m}$ (the finite field of $q^m$ elements) as an ${m}\times{n}$ ...
We present some general techniques for constructing full-rank, minimal-delay, rate at least one spac...
Abstract — We construct full-rank, rate-n Space-Time Block Codes (STBC), over any a priori specified...
We construct full-rank, rate-n space-time block codes (STBC), over any a priori specified signal set...
For a quasi-static, Multiple-input Multiple-output (MIMO) Rayleigh fading channel, high-rate Space-t...
For a quasi-static, multiple-input multiple-output (MIMO)Rayleigh fading channel, high-rate space-ti...
The construction of space time block code (STBCS) over symmetric m-PSK (m-arbitrary) signal sets for...
Let K/F and K/L be two cyclic Galois field extensions and D a cyclic algebra. Given an invertible el...
Abstract — This paper presents a systematic technique for constructing STBC-schemes (Space-Time Bloc...
A linear rank-distance code is a set of matrices over a finite field F/sub q/, with the rank over Fq...
Wireless communication using multiple transmit and receive antennas is very effective when suitable ...
We present families of unital algebras obtained through a doubling process from a cyclic central sim...
A linear rank-distance code is a set of matrices over a finite field $F_q$, with the rank over $F_q$...
Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission chann...
Abstract — Viewing an n length vector over Fqm as an m × n matrix over Fq, by expanding each entry o...
Viewing an n-length vector over $F_{q^m}$ (the finite field of $q^m$ elements) as an ${m}\times{n}$ ...
We present some general techniques for constructing full-rank, minimal-delay, rate at least one spac...
Abstract — We construct full-rank, rate-n Space-Time Block Codes (STBC), over any a priori specified...
We construct full-rank, rate-n space-time block codes (STBC), over any a priori specified signal set...
For a quasi-static, Multiple-input Multiple-output (MIMO) Rayleigh fading channel, high-rate Space-t...
For a quasi-static, multiple-input multiple-output (MIMO)Rayleigh fading channel, high-rate space-ti...
The construction of space time block code (STBCS) over symmetric m-PSK (m-arbitrary) signal sets for...
Let K/F and K/L be two cyclic Galois field extensions and D a cyclic algebra. Given an invertible el...
Abstract — This paper presents a systematic technique for constructing STBC-schemes (Space-Time Bloc...
A linear rank-distance code is a set of matrices over a finite field F/sub q/, with the rank over Fq...
Wireless communication using multiple transmit and receive antennas is very effective when suitable ...
We present families of unital algebras obtained through a doubling process from a cyclic central sim...
A linear rank-distance code is a set of matrices over a finite field $F_q$, with the rank over $F_q$...
Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission chann...
Abstract — Viewing an n length vector over Fqm as an m × n matrix over Fq, by expanding each entry o...
Viewing an n-length vector over $F_{q^m}$ (the finite field of $q^m$ elements) as an ${m}\times{n}$ ...