Name
Abstract | ||
|---|---|---|
In this paper, we propose an “arbitrarily varying channel” (AVC) approach to study the capacity of noncoherent transmission in a network that employs randomized linear network coding. The network operation is modeled by a matrix channel over a finite field where the transfer matrix changes arbitrarily from time-slot to time-slot but up to a known distribution over its rank. By extending the AVC results to this setup, we characterize the capacity of such a non-coherent transmission scheme and show that subspace coding is optimal for achieving the capacity. By imposing a probability distribution over the state space of an AVC, we obtain a channel which we called “partially arbitrarily varying channel” (PAVC). In this work, we characterize the “randomized” as well as the “deterministic” code capacity of a PAVC under the average error probability criterion. Although we introduce the PAVC to model the non-coherent network coding, this extension to an AVC might be of its own interest as well. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISIT.2012.6283561 | Information Theory Proceedings |
Keywords | Field | DocType |
probability,encoding,probability distribution,transfer matrix,finite field,network coding,channel coding,probabilistic logic,error probability | Linear network coding,Topology,Discrete mathematics,Subspace topology,Computer science,Matrix (mathematics),Communication channel,Theoretical computer science,Probability distribution,State space,Channel capacity,Variable-length code | Conference |
Volume | Issue | ISSN |
null | null | 2157-8095 E-ISBN : 978-1-4673-2578-3 |
ISBN | Citations | PageRank |
978-1-4673-2578-3 | 3 | 0.38 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mahdi Jafari | 1 | 107 | 10.52 |
| Shenghao Yang | 2 | 128 | 15.00 |
| Raymond W. Yeung | 3 | 4302 | 580.31 |