Rateless codes, also known as fountain codes, are a class of erasure error-control codes that are particularly well suited for broadcast/ multicast systems. Raptor codes, as a particularly successful implementation of digital fountain codes, have been used as the applicationlayer forward error correction (FEC) codes in the third generation partnership program (3GPP) Multimedia Broadcast and Mul...

The main purpose of this paper is the exploitation and application of an audio and video bimodal corpus of the Chinese language in broadcasting. It deals with the designation of the size and structure of speech samples according to radio and television program features. Secondly, it discusses annotation method of broadcast speech with achievements made and suggested future improvements. Finally...

This paper introduces the specification of abortable consensus in message passing systems with prob-abilistic message delivery behaviors to address the tradeoff between progress and agreement in asyn-chronous consensus. The paper presents an abortable consensus algorithm, proves its correctness, andshows how to configure the parameters of the algorithm to satisfy the explicit re...

Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalization for fountain codes operating on erasure channels and we generalize the problem formalization to arbitrary types of channels. We introduce a novel type of rateless codes based on the turbo principle: the Turbo-Fountain. The TurboFountain is able to c...

In this paper, we construct an efficient “multi-receiver identity-based encryption scheme”. Our scheme only needs one (or none if precomputed and provided as a public parameter) pairing computation to encrypt a single message for n receivers, in contrast to the simple construction that re-encrypts a message n times using Boneh and Franklin’s identity-based encryption scheme, considered previous...

In this paper the logical process structure of the Chandy-Misra parallel simulation algorithm has been studied. The excessive synchronization caused by the algorithm is avoided by minimizing the number of connections between logical processes. The amount of connections are reduced by restricting the direct communication of the logical processes to their neighborhoods. Two methods, message path ...

Recently, there has been a growing interest in peer-to-peer networks, sparked by the popularity of file sharing applications such as Napster and Gnutella. A typical characteristic of a peer-to-peer system is that all the nodes are equal participants in the network. Gnutella is an example of a ‘pure’ peer-to-peer system, being fully distributed where all nodes are equal and no special nodes with...