Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CISS

2008

IEEE

2008

IEEE

—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between the two nodes, each path having a ﬁxed probability of success (perhaps representing an a priori estimate of the security of the path). The original message is encoded using a maximumdistance separable code. We ﬁnd the minimum redundancy and optimal path symbol allocation for the 3-path case based on a desired success probability and the path success probabilities. Two algorithms are presented for determining the minimum required redundancy – an exponential time algorithm (MRAET) and a polynomial time algorithm (MRAPT). We show that MRAET is optimal in several cases, and that both algorithms perform very well.

Related Content

Added |
29 May 2010 |

Updated |
29 May 2010 |

Type |
Conference |

Year |
2008 |

Where |
CISS |

Authors |
Anna Kacewicz, Stephen B. Wicker |

Comments (0)