Linear programming bounds for unitary space time codes

Details Linear programming bounds for unitary space time codes Linear programming bounds for unitary space time codes

2008-03-08

arxiv.org/abs/0803.1227v1

Computer Science

Information Theory

Submitted to ISIT 2008 4 figures

Scientific paper

The linear programming method is applied to the space $\U_n(\C)$ of unitary
matrices in order to obtain bounds for codes relative to the diversity sum and
the diversity product. Theoretical and numerical results improving previously
known bounds are derived.

Affiliated with

Also associated with

No associations

Rating

Linear programming bounds for unitary space time codes 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 Linear programming bounds for unitary space time codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear programming bounds for unitary space time codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-445360