(Research) Distributed fountain codes: concept and analysis

Add to your list(s) Download to your calendar using vCal

• A. Tarable and I. Chatzigeorgiou
• Monday 01 December 2008, 13:00-14:00
• SS03, William Gates Building.

If you have a question about this talk, please contact Andrew Rice.

Note unusual time and venue

Fountain codes are a natural coding solution for broadcasting: in such a case, they are a good alternative to ARQ , especially when none or little feedback can be used. But their versatile structure allows using them as a protocol for many communication network topologies. The talk explores the application of fountain codes to a single-hop multi-relay network. Specifically, in the considered system, relays do not decode the information, but simply perform parity checks on symbols they have received from the source. This allows for uncoordinated, low-complexity algorithms at the intermediate nodes. Thus, the presented protocol, whose analysis and design are described in the talk, represents a hybrid between fountain codes and network coding, named distributed fountain codes, whose potential makes it a promising candidate for next-generation wireless LANs.

This talk is part of the Computer Laboratory Digital Technology Group (DTG) Meetings series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Digital Technology Group (DTG) Meetings
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• SS03, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.