The Capacity of Random Linear Coding Networks as Subspace Channels

Details The Capacity of Random Linear Coding Networks as Subspace Channels The Capacity of Random Linear Coding Networks as Subspace Channels

2010-01-07

arxiv.org/abs/1001.1021v2

Computer Science

Information Theory

5 pages, submitted to ISIT 2010; reference corrected

Scientific paper

In this paper, we consider noncoherent random linear coding networks (RLCNs) as a discrete memoryless channel (DMC) whose input and output alphabets consist of subspaces. This contrasts with previous channel models in the literature which assume matrices as the channel input and output. No particular assumptions are made on the network topology or the transfer matrix, except that the latter may be rank-deficient according to some rank deficiency probability distribution. We introduce a random vector basis selection procedure which renders the DMC symmetric. The capacity we derive can be seen as a lower bound on the capacity of noncoherent RLCNs, where subspace coding suffices to achieve this bound.

Affiliated with

Also associated with

No associations

Rating

The Capacity of Random Linear Coding Networks as Subspace 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 The Capacity of Random Linear Coding Networks as Subspace Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Capacity of Random Linear Coding Networks as Subspace Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-373107