Abstract
Digital fountains, a class of erasure codes, have been used for multicasting stream data and for robust distributed data storage. These methods produce a potentially endless sequence of packets from a fixed (static) message. The dynamic erasure code problem is to extend the digital fountains concept to a message generated simultaneously with the transmission (i.e., live data). Solution of this problem provides a means for robust multicasting or one-way transmission of live data on a computer network. It also gives a method for robust distributed storage of log data, or other serially generated data. A new erasure code is proposed as a solution to the dynamic erasure code problem. It is analytically shown to have a fast decoding algorithm and to be highly bandwidth-efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
