Sharif Digital Repository

In this paper we define Broadcast Relay Networks (BRN) with two relays. There are a transmitter, two relays and two receivers in the network. We find an achievable rate region for it by considering full cooperation between relays. We use symmetric relaying method at relays and Marton's broadcast code construction for the transmitter.We will show that Kramer's rate region for Broadcast Relay Channel (BRC), Ghabeli's rate for symmetric two-relay network, and Marton's rate region for Broadcast Channel are special cases of our achievable rate region  

The progressive-edge-growth (PEG) algorithm of Hu et al. is modified to improve the error floor performance of the constructed low-density parity-check (LDPC) codes. To improve the error floor, the original PEG algorithm is equipped with an efficient algorithm to find the dominant elementary trapping sets (ETS's) that are added to the Tanner graph of the under-construction code by the addition of each variable node and its adjacent edges. The aim is to select the edges, among the candidates available at each step of the original PEG algorithm, that prevent the creation of dominant ETS's. The proposed method is applicable to both regular and irregular variable node degree distributions.... 

A novel family of codes for modified spectral-amplitude-coding optical code division multiple access (SAC-OCDMA) is introduced. The proposed codes exist for more processing gains than the previously reported codes do. In the network using these codes, the number of users can be extended without any essential changes in the previous transmitters. In this study, we propose a construction method for these codes and compare their performance with previously reported codes  

The authors consider the problem of broadcast-relay-networks with two cooperative relays. There are a transmitter, two relays and two receivers in the network. The message of the transmitter intended to the receivers has common and private parts. The relays fully cooperate with each other and with the transmitter to send the common part of the message, whereas the private parts of the message are sent through the direct links between the transmitter and receivers. The authors found an achievable rate region for this network by using the symmetric relaying strategy. In this strategy, each relay completely decodes the message of other relay. In the proof the authors took advantage of regular... 

The authors consider the problem of finding a minimum cost multicast sub-graph based on network coding, where delay values associated with each link, limited buffer-size of the intermediate nodes and link capacity variations over time are taken into account. The authors consider static multicast (where membership of the multicast group remains constant for the duration of the connection) in lossless wireline networks. For such networks, first the continuous-time (asynchronous packet transmissions) model is formulated. Subsequently, the discrete-time model for the synchronous packet transmissions scenario is derived. Then, by using an auxiliary time-expanded network, a decentralised algorithm...