|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'503'724
Articles rated: 2609
24 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Fast-Group-Decodable STBCs via Codes over GF(4) | | N. Lakshmi Prasad
; B. Sundar Rajan
; | | Date: |
13 Jan 2010 | | Abstract: | 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. | | Source: | arXiv, 1001.2076 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER