The paper concerns time-efficient k-shot broadcasting in undirected radio networks. In a k-shot broadcasting algorithm, each node in the network is allowed to transmit at most k times. Both known and unknown topology models are considered. For the known topology model, the problem has been studied before by Ga̧sieniec et al. [14], who established an upper bound of D + O(kn1/(k−2) log n) and a lo...

No-broadcasting theorem is one of the most fundamental results in quantum information theory; it guarantees that simplest attacks on any protocol, based eavesdropping and copying information, are impossible. Due to importance no-broadcasting theorem, essential understand exact boundaries this limitation. We generalize standard definition broadcasting by restricting set states which we want broa...

Broadcasting is a process in which an individual has an item of information which needs to be transmitted to all of the members in a network (which is viewed as a connected graph). -broadcasting is a variant of broadcasting in which each processor can transmit the message to up to of its neighbors in one time unit. Another variant of broadcasting is the concept of m-time-relaxed broadcasting, w...

We derive the optimal universal broadcasting for mixed states of qubits. We show that the no-broadcasting theorem cannot be generalized to more than a single input copy. Moreover, for four or more input copies it is even possible to purify the input states while broadcasting. We name such purifying broadcasting superbroadcasting.

We study distributed broadcasting protocols with few transmissions (‘shots’) in radio networks of unknown topology. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. We focus on oblivious algorithms, that is, algorithms where each node decides whether to transmit or not with no consideration of the transmissi...

The study aims at developing communication strategies for the public broadcasting system according to WTP (Willingness to Pay) for the subscription fee and the audience’s perception of the public broadcasting system as a public good. A quasi-experiment was conducted for audiences who have previously watched public broadcasting channels. According to the results, those respondents who think of p...

Broadcasting is an important collective communication operation in many applications which use parallel computing. In this paper, we focus on designing broadcasting algorithms for general incomplete star graphs. We propose two optimal one-to-all broadcasting algorithms for incomplete star graphs with a single-port communication model. An incomplete star graph with N nodes, where (n 1)! < N < n!...