On the Capacity of Multiplicative Finite-Field Matrix Channels

Details On the Capacity of Multiplicative Finite-Field Matrix Channels On the Capacity of Multiplicative Finite-Field Matrix Channels

2011-05-30

arxiv.org/abs/1105.6115v2

Computer Science

Information Theory

30 pages, 11 figures

Scientific paper

This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. Our model allows this transfer matrix to have any rank, while assuming that all transfer matrices with the same rank are equiprobable. While in general the capacity cannot be obtained in closed form, we provide a simplification of the problem (from $q^{nm}$ to $n+1$ variables) which allows for easy numerical computation. A tight upper bound on the capacity is also derived, and for the special case of constant-rank input, we obtain an exact formula. Several existing results can be obtained as special cases of our approach. In addition, we prove that the well-known approach of treating inputs and outputs as subspaces is information-lossless even in this more general case.

Affiliated with

Also associated with

No associations

Rating

On the Capacity of Multiplicative Finite-Field Matrix Channels 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 On the Capacity of Multiplicative Finite-Field Matrix Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Capacity of Multiplicative Finite-Field Matrix Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337156