Some simple observations on MISO codes

No abstract is available for this paper.

• Publication year

  2010

• Venue

  International Symposium on Information Theory and its Applications

• Publication date

  2010-12-03

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/ISITA.2010.5654389
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity

  2009cited by this paper
• Novel Rotated Quasi-Orthogonal Space-Time Block Codes With the Fixed Nearest Neighbor Number

  2009cited by this paper
• Some properties of Alamouti-like MISO codes

  2009cited by this paper
• New Space–Time Code Constructions for Two-User Multiple Access Channels

  2009cited by this paper
• Construction Methods for Asymmetric and Multiblock Space–Time Codes

  2009cited by this paper
• Constructions of Multiblock Space–Time Coding Schemes That Achieve the Diversity–Multiplexing Tradeoff

  2008cited by this paper
• Maximal Orders in the Design of Dense Space-Time Lattice Codes

  2008cited by this paper
• Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity

  2008cited by this paper
• Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory

  2007cited by this paper
• Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels

  2007influential reference
• On the Densest MIMO Lattices From Cyclic Division Algebras

  2007cited by this paper
• Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion

  2006cited by this paper
• Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff

  2006cited by this paper
• Approximately universal codes over slow-fading channels

  2005cited by this paper
• On optimal quasi-orthogonal space-time block codes with minimum decoding complexity

  2005cited by this paper
• Signal constellations for quasi-orthogonal space-time block codes with full diversity

  2004influential reference
• Asymptotic-Information-Lossless Designs and the Diversity–Multiplexing Tradeoff

  2004cited by this paper
• Diversity-multiplexing tradeoff in multiple-access channels

  2004influential reference
• Asymptotic-information-lossless designs and diversity-multiplexing tradeoff

  2004cited by this paper
• Diagonal algebraic space-time block codes

  2002cited by this paper
• Signal Space Diversity: A Power- and Bandwidth-Efficient Diversity Technique for the Rayleigh Fading Channel

  1998cited by this paper

• The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes

  2021cites this paper
• Space-Time Block Codes

  2014cites this paper
• Remarks on criteria for achieving the optimal diversity-multiplexing gain trade-off

  2013cites this paper
• An Enhanced DMT-Optimality Criterion for STBC Schemes for Asymmetric MIMO Systems

  2012cites this paper
• Fast-Decodable Asymmetric Space-Time Codes From Division Algebras

  2010cites this paper