Fast-Group-Decodable STBCs via Codes over GF(4)

Details Fast-Group-Decodable STBCs via Codes over GF(4) Fast-Group-Decodable STBCs via Codes over GF(4)

2010-01-13

arxiv.org/abs/1001.2076v1

Computer Science

Information Theory

15 pages, 1 table

Scientific paper

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

Affiliated with

Also associated with

No associations

Rating

Fast-Group-Decodable STBCs via Codes over GF(4) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast-Group-Decodable STBCs via Codes over GF(4), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast-Group-Decodable STBCs via Codes over GF(4) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524787