Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Des Codes Crypt

Search In Journal Title:

Abbravation: Designs, Codes and Cryptography

Search In Journal Abbravation:

Publisher

Kluwer Academic Publishers-Plenum Publishers

Search In Publisher:

DOI

10.1007/bf00524592

Search In DOI:

ISSN

1573-7586

Search In ISSN:
Search In Title Of Papers:

Applications of representation theory to wireless

Authors: Ali Miri Monica Nevins Terasan Niyomsataya
Publish Date: 2006/10/24
Volume: 41, Issue: 3, Pages: 307-318
PDF Link

Abstract

In this paper we demonstrate a new and original way to apply the representation theory of finite groups to the development of space–time codes for use in multiple antenna wireless communications We include a summary of the relevant mathematical model for wireless communications on a multipleantenna environment We apply our construction in two examples and demonstrate that they outperform other designs in the literature

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Composition of recursions and nonlinear complexity of periodic binary sequences
  2. Practical-time attacks against reduced variants of MISTY1
  3. On the largest affine sub-families of a family of NFSR sequences
  4. The dimension of subcode-subfields of shortened generalized Reed–Solomon codes
  5. On explicit factors of cyclotomic polynomials over finite fields
  6. Two classes of optimal two-dimensional OOCs
  7. Sequences with small correlation
  8. Improved algorithms for finding low-weight polynomial multiples in $$\mathbb {F}_{2}^{}[x]$$ and some cryptographic applications
  9. A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
  10. Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
  11. A new table of permutation codes
  12. Bent functions embedded into the recursive framework of $${\mathbb{Z}}$$ -bent functions
  13. Nonexistence of CW (110, 100)
  14. Point compression for the trace zero subgroup over a small degree extension field
  15. The Diffie–Hellman problem and generalization of Verheul’s theorem
  16. Modular independence and generator matrices for codes over $${\mathbb {Z}_m}$$
  17. Improved lower bounds on sizes of single-error correcting codes
  18. A combinatorial problem related to sparse systems of equations
  19. Some results concerning cryptographically significant mappings over GF(2 n )
  20. A note on the reducibility of binary affine polynomials
  21. Primitive normal bases for quartic and cubic extensions: a geometric approach
  22. Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$
  23. Some cyclic codes of length 2 p n
  24. On the correlation distribution of Delsarte–Goethals sequences
  25. Algebraic decoding of folded Gabidulin codes
  26. Inner balance of symmetric designs
  27. On the construction of Griesmer codes of dimension 5
Search Result: