2013 IEEE International Conference on Communications (ICC) 2013
DOI: 10.1109/icc.2013.6655394
|View full text |Cite
|
Sign up to set email alerts
|

Field size of random network coding in untrustworthy networks

Abstract: Abstract-We examine the probability of symbol error and the throughput with random network coding in untrustworthy networks, where the network nodes provide false data purposely or unknowingly and the information transmission is subject to channel error. We show that there exists an optimum field size that maximizes the throughput (bits/channel use) or minimizes the probability of symbol error. We examine how the optimum field size depends on the trustworthiness of node and the number of packets that are combi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…We investigate the optimum field size to minimize the probability of symbol error or to maximize the throughput, in terms of the number of combined packets and the trustworthiness of node. This chapter was modified from a paper published in [20].…”
Section: Dissertation Contributions and Outlinementioning
confidence: 99%
“…We investigate the optimum field size to minimize the probability of symbol error or to maximize the throughput, in terms of the number of combined packets and the trustworthiness of node. This chapter was modified from a paper published in [20].…”
Section: Dissertation Contributions and Outlinementioning
confidence: 99%