| dc.contributor.author | Considine, Jeffrey | en_US |
| dc.date.accessioned | 2011-10-20T04:42:38Z | |
| dc.date.available | 2011-10-20T04:42:38Z | |
| dc.date.issued | 2001-10-30 | en_US |
| dc.identifier.uri | http://hdl.handle.net/2144/1640 | |
| dc.description.abstract | Fast forward error correction codes are becoming an important component in bulk content delivery. They fit in naturally with multicast scenarios as a way to deal with losses and are now seeing use in peer to peer networks as a basis for distributing load. In particular, new irregular sparse parity check codes have been developed with provable average linear time performance, a significant improvement over previous codes. In this paper, we present a new heuristic for generating codes with similar performance based on observing a server with an oracle for client state. This heuristic is easy to implement and provides further intuition into the need for an irregular heavy tailed distribution. | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | Boston University Computer Science Department | en_US |
| dc.relation.ispartofseries | BUCS Technical Reports;BUCS-TR-2001-019 | en_US |
| dc.title | Generating Good Degree Distributions for Sparse Parity Check Codes using Oracles | en_US |
| dc.type | Technical Report | en_US |