Search

A memoryless bivariate Gaussian source is transmitted to a pair of receivers over an average-power limited bandwidth-matched Gaussian broadcast channel. Based on their observations, Receiver 1 reconstructs the first source component while Receiver 2 reconstructs the second source component both seeking to minimize the expected squared-error distortions. In addition to the source transmission digital information at a specified rate should be conveyed reliably to Receiver 1–the “stronger” receiver. Given the message rate we characterize the achievable distortions region. Specifically, there is an ${\sf SNR}$ -threshold below which Dirty Paper coding of the digital information against a linear combination of the source components is optimal. The threshold is a function of the digital information rate, the source correlation and the distortion at the “stronger” receiver. Above this threshold a Dirty Paper coding extension of the Tian-Diggavi-Shamai hybrid scheme is shown to be optimal. [ABSTRACT FROM AUTHOR]

The work explores the fundamental limits of coded caching in the setting where a transmitter with potentially multiple ($N_{0}$) antennas serves different users that are assisted by a smaller number of caches. Under the assumption of uncoded cache placement, the work derives the exact optimal worst-case delay and DoF, for a broad range of user-to-cache association profiles where each such profile describes how many users are helped by each cache. This is achieved by presenting an information-theoretic converse based on index coding that succinctly captures the impact of the user-to-cache association, as well as by presenting a coded caching scheme that optimally adapts to the association profile by exploiting the benefits of encoding across users that share the same cache. The work reveals a powerful interplay between shared caches and multiple senders/antennas, where we can now draw the striking conclusion that, as long as each cache serves at least $N_{0}$ users, adding a single degree of cache-redundancy can yield a DoF increase equal to $N_{0}$ , while at the same time — irrespective of the profile — going from 1 to $N_{0}$ antennas reduces the delivery time by a factor of $N_{0}$. Finally some conclusions are also drawn for the related problem of coded caching with multiple file requests. [ABSTRACT FROM AUTHOR]

Copyright of Estudios sobre el Mensaje Periodistico is the property of Universidad Complutense de Madrid and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Objective: To evaluate the effects of Chile's 2016 regulation restricting child-directed marketing of products high in energy, saturated fats, sodium and sugars on reducing children's exposure to 'high-in' television food advertising.Design: Television use by pre-schoolers and adolescents was assessed via surveys in the months prior to implementation and a year after implementation. Hours and channels of television use were linked with the amount of high-in food advertising observed in corresponding content analyses of food advertisements (ads) from popular broadcast and cable channels to estimate changes in exposure to food ads from these channels.Setting: Middle-lower and lower-income neighbourhoods in Santiago, Chile.Participants: Pre-schoolers (n 879; mothers reporting) and adolescents (n 753; self-reporting).Results: Pre-schoolers' and adolescents' exposure to high-in food advertising in total decreased significantly by an average of 44 and 58 %, respectively. Exposure to high-in food advertising with child-directed appeals, such as cartoon characters, decreased by 35 and 52 % for pre-schoolers and adolescents, respectively. Decreases were more pronounced for children who viewed more television. Products high in sugars were the most prevalent among the high-in ads seen by children after implementation.Conclusions: Following Chile's 2016 child-directed marketing regulation, children's exposure to high-in food advertising on popular broadcast and cable television decreased significantly but was not eliminated from their viewing. Later stages of the regulation are expected to eliminate the majority of children's exposure to high-in food advertising from television. [ABSTRACT FROM AUTHOR]

Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user’s local cache memory, even without knowledge of user’s later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strategy for broadcast channels with cache-aided users. This paper investigates the same model under the constraint that content is placed uncoded within the caches, that is, when bits of the files are simply copied within the caches. When the cache contents are uncoded and the users’ demands are revealed, the caching problem can be connected to an index coding problem. This paper focuses on deriving fundamental performance limits for the caching problem by using tools for the index coding problem that were either known or are newly developed in this work. First, a converse bound for the caching problem under the constraint of uncoded cache placement is proposed based on the “acyclic index coding converse bound.” This converse bound is proved to be achievable by the Maddah-Ali and Niesen’s scheme when the number of files is not less than the number of users, and by a newly derived index coding achievable scheme otherwise. The proposed index coding achievable scheme is based on distributed source coding and strictly improves on the widely used “composite (index) coding” achievable bound and its improvements, and is of independent interest. An important consequence of the findings of this paper is that advancements on the coded caching problem posed by Maddah-Ali and Niesen are thus only possible by considering strategies with coded placement phase. A recent work by Yu et al has however shown that coded cache placement can at most half the network load compared to the results presented in this paper. [ABSTRACT FROM AUTHOR]

In this work, we consider the sum rate performance of joint processing coordinated multi-point transmission network (JP-CoMP, a.k.a Network MIMO) in a so-called distributed channel state information (D-CSI) setting. In the D-CSI setting, the various transmitters (TXs) acquire a local, TX-dependent, estimate of the global multi-user channel state matrix obtained via terminal feedback and limited backhauling. The CSI noise across TXs can be independent or correlated, so as to reflect the degree to which TXs can exchange information over the backhaul, hence allowing to model a range of situations bridging fully distributed and fully centralized CSI settings. In this context we aim to study the price of CSI distributiveness in terms of sum rate at finite SNR when compared with conventional centralized scenarios. We consider the family of JP-CoMP precoders known as regularized zero-forcing (RZF). We conduct our study in the large scale antenna regime, as it is currently envisioned to be used in real 5G deployments. It is then possible to obtain accurate approximations on so-called deterministic equivalents of the signal to interference and noise ratios. Guided by the obtained deterministic equivalents, we propose an approach to derive a RZF scheme that is robust to the distributed aspect of the CSI, whereby the key idea lies in the optimization of a TX-dependent power level and regularization factor. Our analysis confirms the improved robustness of the proposed scheme with respect to CSI inconsistency at different TXs, even with moderate number of antennas and receivers (RXs). [ABSTRACT FROM AUTHOR]

Copyright of Journal of Social Sciences Research / Sosyal Bilimler Arastirmalari Dergisi is the property of ODU Journal of Social Sciences Research and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The mixed information stream of reliable, semi-reliable and obviously false data observed in the network is a data flow in the so-called facilitated format, the task of which is to somehow attract attention, influence the emotional sphere in the form of hype-information, which helps to make hasty decisions and harm-actions. A growing variety of forms of technological push-impact, which are successfully used for commercial purposes. Nevertheless, the study of various push-forms shows that they are based on a single semantic component that uses the offset of actual concepts to achieve the benefit of the information provider. The consumer of push services receives an apparent benefit that is far from his actual interests and intentions. A semantic computational model is proposed that captures the emerging bias of concepts. The concept of a semantic broadcasting channel is developing. The paper considers the task of constructing specialized semantic systems in the form of information graphs. The information graphs are considered as structured sets of vertices that define the method of processing information and are connected by arcs, describing the sequence of processing. In its turn, an information graph can be used as an arc, which gives hyper-graph nature to the network in the whole. The information graphs are compared with other data flow control tools. The tools for constructing transformational semantics for calculations above information graphs are offered, which assume the specialization for the class of computations associated with the vertices of the graph. A method for making an abstract computing machine with a given semantics is proposed. The paper considers an example of making an abstract machine for the case of deterministic semantics, which is illustrative for certain fragments of antimonopoly legislation. [ABSTRACT FROM AUTHOR]

Consider the asymmetric broadcast channel with a random superposition codebook, which may be comprised of constant composition or i.i.d. codewords. By applying Forney’s optimal decoder for individual messages and the message pair for the receiver that decodes both messages, exact (ensemble-tight) error and erasure exponents are derived. It is shown that the optimal decoder designed to decode the pair of messages achieves the optimal trade-off between the total and undetected exponents associated with the optimal decoder for the private message. Convex optimization-based procedures to evaluate the exponents efficiently are proposed. Finally, numerical examples are presented to illustrate the results. [ABSTRACT FROM AUTHOR]

In this paper, we study the arbitrarily varying broadcast channel (AVBC) when the state information is available at the transmitter in a causal manner. We establish the inner and outer bounds on both the random code capacity region and the deterministic code capacity region with degraded message sets. The capacity region is then determined for a class of channels satisfying a condition on the mutual information between the strategy variables and the channel outputs. As an example, we consider the arbitrarily varying binary symmetric broadcast channel. We show the cases where the condition holds and, hence, the capacity region is determined and other cases where there is a gap between the bounds. This gap shows that the minimax theorem does not hold for rate regions. [ABSTRACT FROM AUTHOR]

Content delivery in a multi-user cache-aided broadcast network is studied, where a server holding a database of correlated contents communicates with the users over a Gaussian broadcast channel (BC). The minimum transmission power required to satisfy all possible demand combinations is studied, when the users are equipped with caches of equal size. Two centralized caching schemes are proposed, both of which not only utilize the user’s local caches, but also exploit the correlation among the contents in the database. The first scheme implements uncoded cache placement and delivers coded contents to users using superposition coding. The second scheme, which is proposed for small cache sizes, places coded contents in users’ caches and jointly encodes the cached contents of users and the messages targeted at them. The performance of the proposed schemes, which provide upper bounds on the required transmit power for a given cache capacity, is characterized. The scheme based on coded placement improves upon the first one for small cache sizes, and under certain conditions meets the uncoded placement lower bound. A lower bound on the required transmit power is also presented assuming uncoded cache placement. Our results indicate that exploiting the correlations among the contents in a cache-aided Gaussian BC can provide significant energy savings. [ABSTRACT FROM AUTHOR]

In this paper, we study the secrecy performance of a $K$ -user multi-input single-output (MISO) broadcast channel with random beamforming (RB), where the transmitter is equipped with $N$ antennas, and the eavesdropper has $N_e$ antennas. We first propose a signal-splitting random beamforming (SSRB) scheme for a single-user MISO wiretap channel, and then improve the SSRB scheme with power-minimizing (PM), which is called a PM-SSRB scheme. To improve the spectral efficiency of a multiuser network, we combine PM with non-orthogonal multiple access (NOMA), and propose a hybrid NOMA (H-NOMA) scheme and a signal-splitting NOMA (SS-NOMA) scheme for the $K$ -user MISO wiretap channel, respectively. The sum ergodic secrecy rate of the $K$ -user scenario is analyzed comprehensively, and a closed-form expression for the lower bound on the ergodic secrecy rate is also derived for the single-user case. Simulation results show that, compared with the traditional hybrid artificial fast-fading scheme (AFF) and artificial noise (AN) scheme, the proposed SSRB scheme and PM-SSRB scheme perform much better in terms of the ergodic secrecy rate in all power regimes. More importantly, when the eavesdropper has more antennas than the transmitter, our schemes always outperform the AFF and AN schemes. The PM-SSRB scheme is also shown to be superior to the secret-key AFF scheme. For the multiuser case, the SS-NOMA scheme can achieve higher ergodic secrecy rate than the H-NOMA scheme. [ABSTRACT FROM AUTHOR]

In mobile wireless broadcast networks, XML data is encrypted before it is sent over the broadcast channel in order to ensure the confidentiality of XML data. In these networks, mobile clients must not have access to all the XML data; rather they should have access to some parts of the XML data that are relevant to them and to which they are authorized to have access. In this paper, a new encrypted XML data stream structure is proposed which supports the confidentiality of XML data over the broadcast channel. In our proposed stream structure, the size of encrypted XML data stream is reduced by grouping the paths, XML nodes, texts, and attributes together. The proposed structure includes several indexes to skip from irrelevant data over the broadcast channel. The experimental results demonstrate that the use of our proposed stream structure efficiently disseminates XML data in mobile wireless broadcast networks in a secure manner and the indexes in our proposed stream structure improve the performance of XML query processing over the encrypted XML data stream. [ABSTRACT FROM AUTHOR]

Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a function of the receivers’ cache sizes, and the bounds are shown to match for interesting special cases. The lower bounds are achieved by two new coding schemes that benefit from nonuniform cache assignments. Lower and upper bounds are also established on the global capacity-memory tradeoff, i.e., on the largest capacity-memory tradeoff that can be attained by optimizing the receivers’ cache sizes subject to a total cache memory budget. The bounds coincide when the total cache memory budget is sufficiently small or sufficiently large, where the thresholds depend on the BC statistics. For small cache memories, it is optimal to assign all the cache memory to the weakest receiver. In this regime, the global capacity-memory tradeoff grows by the total cache memory budget divided by the number of files in the system. In other words, a perfect global caching gain is achievable in this regime and the performance corresponds to a system where all the cache contents in the network are available to all receivers. For large cache memories, it is optimal to assign a positive cache memory to every receiver, such that the weaker receivers are assigned larger cache memories compared to the stronger receivers. In this regime, the growth rate of the global capacity-memory tradeoff is further divided by the number of users, which corresponds to a local caching gain. It is observed numerically that a uniform assignment of the total cache memory is suboptimal in all regimes, unless the BC is completely symmetric. For erasure BCs, this claim is proved analytically in the regime of small cache sizes. [ABSTRACT FROM AUTHOR]

We study the $K=3$ user multiple input single output (MISO) broadcast channel (BC) with $M=3$ antennas at the transmitter and 1 antenna at each receiver, from the generalized degrees of freedom (GDoF) perspective, under the assumption that the channel state information at the transmitter (CSIT) is limited to the finite precision. In particular, our goal is to identify a parameter regime where a simple layered superposition (SLS) coding scheme achieves the entire GDoF region. With $\alpha _{ij}$ representing the channel strength parameter for the link from the $j^{th}$ antenna of the transmitter to the $i^{th}$ receiver, we prove that the SLS is GDoF optimal without the need for time-sharing if $\max (\alpha _{ki},\alpha _{im})\leq \alpha _{ii}$ and $\alpha _{ki}+\alpha _{im}\le \alpha _{ii}+\alpha _{km}$ for all $i,k\in [{3}],m\in [M]$. The GDoF region under this condition is a convex polyhedron. The result generalizes to arbitrary $M\geq 3$. [ABSTRACT FROM AUTHOR]

We first put forward an efficient protocol in ideal environment to deterministically realize bidirectional hybrid quantum communication via a five-qubit entangled state as the quantum channel, where both the senders transfer an arbitrary single-qubit state to each other simultaneously with the assistance of the controller. It is worth mentioning that three-bit classical communication can be saved at the broadcast channel by the technology of network coding. Moreover, the senders do not need to perform information splitting and additional unitary operations owing to the elaborate measurement basis we constructed. Then we investigate the protocol in five-type noises (the bit flip, phase flip, bit-phase flip, phase-damping and amplitude-damping noise) and calculate the corresponding fidelities of the output states. [ABSTRACT FROM AUTHOR]

The problem of merging multiple services over multiple-input multiple-output Gaussian broadcast channels with two receivers is studied. The transmitter provides two independent services: a public (multicast) service with a common message for both users, and a private service with a confidential message intended only for one of the users which is to be kept secret from the other. Under this scenario, a new linear precoding scheme is developed to maximize secrecy-multicast rate region. This scheme decomposes input covariance matrix using rotation matrices and results in a reformulation of the secrecy-multicast capacity region which is easier to be optimized. Next, by finding the distributions to which eigenvalues and rotation angles fit in, a search algorithm is proposed to solve the new capacity expression to find precoding and power allocation matrices. Numerical results illustrate that the proposed precoding method significantly increases the rate region compared to the existing methods. [ABSTRACT FROM AUTHOR]

Due to its promising performance in a wide range of practical scenarios, Rate-Splitting (RS) has recently received significant attention in academia for the downlink of communication systems. In this letter, we propose and analyse a Cooperative Rate-Splitting (CRS) strategy based on the three-node relay channel where the transmitter is equipped with multiple antennas. By splitting user messages and linearly precoding common and private streams at the transmitter, and opportunistically asking the relaying user to forward its decoded common message, CRS can efficiently cope with a wide range of propagation conditions (disparity of user channel strengths and directions) and compensate for the performance degradation due to deep fading. The precoder design and the resource allocation are optimized by solving the Weighted Sum Rate (WSR) maximization problem. Numerical results demonstrate that our proposed CRS scheme can achieve an explicit rate region improvement compared to its non-cooperative counterpart and other cooperative strategies (such as cooperative NOMA). [ABSTRACT FROM AUTHOR]

We consider the broadcasting of a scalar memoryless Gaussian source over a two-user Gaussian broadcast channel with bandwidth expansion. In concurrent with the source description, a message that should be decoded reliably just by the “higher quality” user is sent. Conditioned on the message rate, we derive a necessary condition for the achievability of a mean-squared-error distortion pair at the two receivers, which extends the Reznic–Feder–Zamir bound. This necessary condition and a sufficient condition that we derive establish the set of achievable energy-distortion exponents for this setting. [ABSTRACT FROM AUTHOR]

In this paper, we make use of channel symmetry properties to determine the capacity region of three types of two-way networks: 1) two-user memoryless two-way channels (TWCs); 2) two-user TWCs with memory; and 3) three-user multiaccess/degraded broadcast (MA/DB) TWCs. For each network, symmetry conditions under which a Shannon-type random coding inner bound (under independent non-adaptive inputs) is tight are given. For two-user memoryless TWCs, prior results are substantially generalized by viewing a TWC as two interacting state-dependent one-way channels. The capacity of symmetric TWCs with memory, whose outputs are functions of the inputs and independent stationary and ergodic noise processes, is also obtained. Moreover, various channel symmetry properties under which the Shannon-type inner bound is tight are identified for three-user MA/DB TWCs. The results not only enlarge the class of symmetric TWCs whose capacity region can be exactly determined but also imply that interactive adaptive coding, not improving capacity, is unnecessary for such channels. [ABSTRACT FROM AUTHOR]

Historically, broadcasters have used on-premises channel origination systems requiring periodic replacement, capital expense planning, and asset depreciation. With a shortening replacement cycle caused by rapid technology advances, coupled with the difficulty in accurately forecasting future storage, processing, and networking requirements, the traditional channel origination approach has become unacceptable. Channel origination as a service allows broadcasters to overcome many of the pitfalls of traditional approaches by leveraging a virtualized architecture for all channel functions, each of which is implemented in the cloud. This approach can reliably support frame-accurate and seamless switching between file-based, linear, and live content. Managed security can be provided across all platforms and network infrastructure and can be implemented in world-class data centers and networks. Channel origination, as a service, yields lower recurring operating costs per channel. Control of traffic, master control, and operations may be handled using traditional staffing configurations and workflows, shared across multiple stations, or outsourced to service providers. [ABSTRACT FROM AUTHOR]

Compatibility conditions of quantum channels featuring symmetry through covariance are studied. Compatibility here means the possibility of obtaining two or more channels through partial trace out of a broadcasting channel. We see that covariance conditions can be used to simplify compatibility conditions as the broadcasting channel can be assumed to be covariant in a particular way. A particular emphasis is on Weyl covariance and in determining compatibility conditions for Weyl-covariant channels. The concrete examples studied include the case of a non-compact continuous phase space and the case of a finite phase space. [ABSTRACT FROM AUTHOR]

The broadcast channel with mutual secrecy requirement at the receivers (BC-MSR-R) is a basic model characterizing the physical layer security (PLS) in the down-link of the wireless communication systems, where one transmitter sends two independent messages to two receivers via a broadcast channel, and each receiver can successfully decode his/her intended message and wishes to overhear the other one’s message. This paper studies how to enhance the already existing secrecy rate region of the BC-MSR-R via receivers’ feedback. Specifically, we propose two feedback strategies for the BC-MSR-R, where one uses the feedback to generate pure secret keys protecting the transmitted messages, and the other uses the feedback to generate not only keys but also cooperative messages helping the receivers to improve their decoding performance. Different inner bounds on the secrecy capacity region of the BC-MSR-R with noiseless feedback are constructed according to different feedback strategies, and these bounds are further illustrated by a Dueck-type example. [ABSTRACT FROM AUTHOR]

Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the channel state information at the transmitter (CSIT), these channels for many applications are non-ergodic. The appropriate measure for designing signals in non-ergodic channels is the outage probability. In this paper, we provide a method to optimize space–time block codes (STBCs) based on the outage probability at moderate SNRs. Multilevel polar coded-modulation is a new class of coded-modulation techniques that benefits from low-complexity decoders and simple rate matching. In this paper, we derive the outage optimality condition for multistage decoding and propose a rule for determining component code rates. We also derive an upper bound on the outage probability of STBCs for designing the set-partitioning-based labeling. Finally, due to the optimality of the outage-minimized STBCs for long codes, we introduce a novel method for the joint optimization of short-to-moderate length polar codes and STBCs. [ABSTRACT FROM AUTHOR]

We prove that quantum thermal Gaussian input states minimize the output entropy of the multi-mode quantum Gaussian attenuators and amplifiers that are entanglement breaking and of the multi-mode quantum Gaussian phase contravariant channels among all the input states with an given entropy. This is the first time that this property is proven for a multi-mode channel without restrictions on the input states. A striking consequence of this result is a new lower bound on the output entropy of all the multi-mode quantum Gaussian attenuators and amplifiers in terms of the input entropy. We apply this bound to determine new upper bounds to the communication rates in two different scenarios. The first is classical communication to two receivers with the quantum degraded Gaussian broadcast channel. The second is the simultaneous classical communication, quantum communication and entanglement generation or the simultaneous public classical communication, private classical communication, and quantum key distribution with the Gaussian quantum-limited attenuator. [ABSTRACT FROM AUTHOR]

We consider the cache-aided MISO broadcast channel (BC) in which a multi-antenna transmitter serves $K$ single-antenna receivers, each equipped with a cache memory. The transmitter has access to partial knowledge of the channel state information. For a symmetric setting, in terms of channel strength levels, partial channel knowledge levels and cache sizes, we characterize the generalized degrees of freedom (GDoF) up to a constant multiplicative factor. The achievability scheme exploits the interplay between spatial multiplexing gains and coded-multicasting gain. On the other hand, a cut-set-based argument in conjunction with a GDoF outer bound for a parallel MISO BC under channel uncertainty is used for the converse. We further show that the characterized order-optimal GDoF is also attained in a decentralized setting, where no coordination is required for content placement in the caches. [ABSTRACT FROM AUTHOR]

Index coding, a source coding problem over broadcast channels, has been a subject of both theoretical and practical interests since its introduction (by Birk and Kol, 1998). In short, the problem can be defined as follows: there is an input $P \triangleq (p_{1}, {\dots }, p_{n})$ , a set of $n$ clients who each desire a single entry $p_{i}$ of the input, and a broadcaster whose goal is to send as few messages as possible to all clients so that each one can recover its desired entry. Additionally, each client has some predetermined “side information,” corresponding to the certain entries of the input $P$ , which we represent as the “side information graph” $ \mathcal {G}$. The graph $ \mathcal {G}$ has a vertex $v_{i}$ for client $i$ and a directed edge $(v_{i}, v_{j})$ , indicating that client $i$ knows the $j$ th entry of the input. Given a fixed side information graph $ \mathcal {G}$ , we are interested in determining or approximating the “broadcast rate” of index coding on the graph, i.e., the least number of messages the broadcaster can transmit so that every client recovers its desired information. The complexity of determining this broadcast rate in the most general case is open, and the best-known approximations are barely better than the trivial $O(n)$ -approximation corresponding to sending each client their information directly without performing any coding. Using index coding schemes based on linear programs (LPs), we take a two-pronged approach to approximating the broadcast rate. First, extending earlier work on planar graphs, we focus on approximating the broadcast rate for special graph families, such as graphs with the small chromatic number and disk graphs. In certain cases, we are able to show that simple LP-based schemes give constant-factor approximations of the broadcast rate, which seem extremely difficult to obtain in the general case. Second, we provide several LP-based schemes for the general case, which are not constant-factor approximations, but which strictly improve on the best-known schemes. These can be viewed as both a strengthening of the constant-factor approximations proven for special graph families (as these schemes strictly improve on those which we prove are good approximations), as well as another tool that can be used either in practice or in future theoretical analyses. [ABSTRACT FROM AUTHOR]

Copyright of Al-Mustansiriya Journal of Arts is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Broadcast encryption allows a broadcaster, who wants to distribute messages to a chosen subset of receivers, to produce an encrypted content and transmit it via a broadcast channel. Normally we think that it is preferable if the broadcast encryption system is a public-key cryptosystem, which permits anybody could encrypt and distribute messages with public parameters. Nevertheless, such a broadcast strategy brings along a slew of diffusions of the spam that are uncontrollable. Authenticated public key broadcast encryption ensures that no such strategy can succeed - the encryption algorithm creates ciphertext with public key and the broadcaster's secret key. It means that each broadcasted message is associated to the content distributor in order to ensure accountability. Technically, it embeds a signature in the ciphertext and each authorized users could verify it during decrypting. In this paper, we construct a solution for authenticated public key broadcast encryption using bilinear maps where the ciphertext is of O(1) (only constant number of group elements). The public key size and user private key are of size O(N) (N is the total number of users). The simulation experiment results indicated that the size of public key (private key) is about 4MB where we arbitrarily set N = 100000. Finally, we define the security for authenticated public key broadcast encryption and show that our construction captures static security in the standard model. [ABSTRACT FROM AUTHOR]

A Gaussian source and two data streams are to be transmitted over a Gaussian broadcast channel: the first stream, the “common stream,” is to be decoded by both receivers, and the second, the “private stream,” only by the strong receiver. Both receivers wish to estimate the source sequence, though with possibly different mean squared-errors. The quadruples of achievable rates and estimation errors are characterized, and it is shown that—once the data rates have been fixed—there is no tension between the estimation errors. Only the “equal bandwidth” case is treated, where the rate at which the source emits symbols is also the rate at which the channel is used. [ABSTRACT FROM AUTHOR]

An analogy framework between wiretap channels (WTCs) and state-dependent point-to-point channels with non-causal encoder channel state information (referred to as Gelfand-Pinker channels (GPCs)) is proposed. A good sequence of stealth-wiretap codes is shown to induce a good sequence of codes for a corresponding GPC. Consequently, the framework enables exploiting existing results for GPCs to produce converse proofs for their wiretap analogs. The analogy readily extends to multiuser broadcasting scenarios, encompassing broadcast channels (BCs) with deterministic components, degradation ordering between users, and BCs with cooperative receivers. Given a wiretap BC (WTBC) with two receivers and one eavesdropper, an analogous Gelfand-Pinsker BC (GPBC) is constructed by converting the eavesdropper’s observation sequence into a state sequence with an appropriate product distribution (induced by the stealth-wiretap code for the WTBC), and non-causally revealing the states to the encoder. The transition matrix of the state-dependent GPBC is extracted from WTBC’s transition law, with the eavesdropper’s output playing the role of the channel state. Past capacity results for the semi-deterministic (SD) GPBC and the physically-degraded (PD) GPBC with an informed receiver are leveraged to furnish analogy-based converse proofs for the analogous WTBC setups. This characterizes the secrecy-capacity regions of the SD-WTBC and the PD-WTBC, in which the stronger receiver also observes the eavesdropper’s channel output. These derivations exemplify how the wiretap-GP analogy enables translating results on one problem into advances in the study of the other. [ABSTRACT FROM AUTHOR]

We study two-receiver Poisson channels using tools derived from stochastic calculus. We obtain a general formula for the mutual information over the Poisson channel that allows for conditioning and the use of auxiliary random variables. We then use this formula to compute necessary and sufficient conditions under which one Poisson channel is less noisy and/or more capable than another, which turn out to be distinct from the conditions under which this ordering holds for the discretized versions of the channels. We also use a general formula to determine the capacity region of the more capable Poisson broadcast channel with independent message sets, the more capable Poisson wiretap channel, and the general two-decoder Poisson broadcast channel with degraded message sets. [ABSTRACT FROM AUTHOR]

We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an ordinary receiver and a robust receiver. The channel to the ordinary receiver is a given (known) discrete memoryless channel, whereas the channel to the robust receiver is an arbitrarily varying channel. Both receivers are required to decode the common message (the better-protected message), whereas only the ordinary receiver is required to decode the private message (the less-protected message). As in the single-user case, under the appropriate compactness and convexity conditions, the capacity region is either empty or else the intersection of the capacity regions of the broadcast channels that the various states induce. [ABSTRACT FROM AUTHOR]

This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with ${\mathsf{K}}_{w} $ weak receivers and ${\mathsf {K}}_{s} $ strong receivers, where weak receivers and strong receivers have the same erasure probabilities and cache sizes, respectively. The lower bounds are achieved by the schemes that meticulously combine joint cache-channel coding with wiretap coding and key-aided one-time pads. The presented upper bound holds more generally for arbitrary degraded BCs and arbitrary cache sizes. When only weak receivers have cache memories, upper and lower bounds coincide for small and large cache memories, thus providing the exact secrecy capacity-memory tradeoff for this setup. The derived bounds further allow us to conclude that the secrecy capacity is positive even when the eavesdropper is stronger than all the legitimate receivers with cache memories. Moreover, they show that the secrecy capacity-memory tradeoff can be significantly smaller than its non-secure counterpart, but it grows much faster when cache memories are small. This paper also presents a lower bound on the global secrecy capacity-memory tradeoff where one is allowed to optimize the cache assignment subject to a total cache budget. It is close to the best known lower bound without secrecy constraint. For small total cache budget, the global secrecy capacity-memory tradeoff is achieved by assigning all the available cache memory uniformly over all the receivers if the eavesdropper is stronger than all the legitimate receivers, and it is achieved by assigning the cache memory uniformly only over the weak receivers if the eavesdropper is weaker than the strong receivers. [ABSTRACT FROM AUTHOR]

In this paper we consider the potential benefits of adopting a binary symmetric broadcast channel paradigm for multi-destination aggregation in 802.11 WLANs, as opposed to a more conventional packet erasure channel paradigm. We propose two approaches for multi-destination aggregation, i.e. superposition coding and a simpler time-sharing coding. Theoretical and simulation results for both unicast and multicast traffic demonstrate that increases in network throughput of more than 100% are possible over a wide range of network conditions and that the much simpler time-sharing scheme yields most of these gains and have minimal loss of performance. Importantly, these performance gains are achieved exclusively through software rather than hardware changes. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of weighted sum-rate maximization and mean squared error (MSE) minimization for the multiple-input multiple-output (MIMO) interference channel. Specifically, we consider a weighted minimum MSE architecture where each receiver employs successive interference cancellation (SIC) to separate the various received data streams and derive a hybrid beamforming scheme, where the transmitters operate with a number of radio frequency chains smaller than the number of antennas, particularly suited for millimeter-wave channels and 5G applications. To derive our proposed schemes, we first study the relationship between sum-rate maximization and weighted MSE minimization when using SIC receivers, assuming fully digital beamforming. Next, we consider the important—and, as it turns out, highly non-trivial—case where the transmitters employ hybrid digital/analog beamforming, developing a distributed joint hybrid precoding and SIC-based combining algorithm. Moreover, for practical implementation, we propose a signaling scheme that utilizes a common broadcast channel and facilitates the acquisition of channel state information, assuming minimal assistance from a central node such as a cellular base station. Numerical results show that both the proposed weighted MMSE-SIC schemes exhibit great advantages with respect to their linear counterparts in terms of complexity, feedback information, and performance. [ABSTRACT FROM AUTHOR]

In this paper, we propose an interference alignment (IA) scheme for the multiple-input multiple-output (MIMO) uplink cellular network with the help of a relay which operates in half-duplex mode. The proposed scheme only requires global channel state information (CSI) knowledge at the relay, with no transmitter beamforming and time extension at the user equipment (UE), which differs from conventional IA schemes for cellular networks. We derive the feasibility condition of the proposed scheme for the general cellular network configuration and analyze the degrees-of-freedom (DoF) performance of the proposed IA scheme while providing a closed-form beamformer design at the relay. Extensions of the proposed scheme to downlink and full-duplex cellular networks are also proposed in this paper. The DoF performance of the proposed scheme is compared to those of linear IA scheme and relay-aided interference management scheme for a cellular network with no time extension. It is also shown that advantages similar to those in the uplink case can be obtained for the downlink case through the duality of a relay-aided interfering multiple-access channel (IMAC) and an interfering broadcast channel (IBC). Furthermore, the proposed scheme for a full-duplex cellular network is shown to have advantages identical to those of a number of proposed half-duplex cellular cases. [ABSTRACT FROM AUTHOR]

We consider network coding for a noiseless broadcast channel, where each receiver demands a subset of the messages available at the transmitter and is equipped with noisy side information in the form of an erroneous version of the message symbols it demands. We view the message symbols as elements from a finite field and assume that the number of symbol errors in the noisy side information is upper bounded by a known constant. This communication problem, which we refer to as broadcasting with noisy side information (BNSI), has applications in the re-transmission phase of downlink networks. We derive a necessary and sufficient condition for a linear coding scheme to satisfy the demands of all the receivers in a given BNSI network, and show that syndrome decoding can be used at the receivers to decode the demanded messages from the received codeword and the available noisy side information. We represent BNSI problems as bipartite graphs, and using this representation, classify the family of problems, where linear coding provides bandwidth savings compared to uncoded transmission. We provide a simple algorithm to determine if a given BNSI network belongs to this family of problems, i.e., to identify if linear coding provides an advantage over uncoded transmission for the given BNSI problem. We provide lower bounds and upper bounds on the optimal codelength and constructions of linear coding schemes based on linear error correcting codes. For any given BNSI problem, we construct an equivalent index coding problem. A linear code is a valid scheme for a BNSI problem if and only if it is valid for the constructed scalar linear index coding problem. [ABSTRACT FROM AUTHOR]

In this paper we study the impact of time shifting on TV consumption and ad viewership. We analyze the results of a field experiment in which a random sample of "triple-play" households were given a set of premium TV channels broadcasting popular movies and TV shows without commercial breaks. A random subset of these households were given access to these channels with time shifting (automated cloud recording for later viewing or rewinding of broadcasted programs), while the remainder were not. This design allowed us to identify the effects of time shifting on TV consumption. On average, we found that receiving access to the channels with time shifting increased total TV consumption because it increased time-shifted viewership while leaving live viewership unchanged. The increase in the live viewership of these channels was similar to the reduction in the live viewership of the originally available channels, resulting in a net zero effect on live viewership. It appears that time shifting does not change the concentration of live viewership, but it does increase the concentration of total TV viewership, because it is used disproportionately to watch the most popular programs. Finally, we found that time shifting does not change the likelihood of skipping ads during live viewership, suggesting that households do not use time shifting to strategically avoid ads. The online appendix is available at https://doi.org/10.1287/mnsc.2018.3084. This paper was accepted by Matthew Shum, marketing. [ABSTRACT FROM AUTHOR]

When analyzing the round complexity of multi-party protocols, one often overlooks the fact that underlying resources, such as a broadcast channel, can by themselves be expensive to implement. For example, it is well known that it is impossible to implement a broadcast channel by a (deterministic) protocol in a sublinear (in the number of corrupted parties) number of rounds. The seminal works of Rabin and Ben-Or from the early 1980s demonstrated that limitations as the above can be overcome by using randomization and allowing parties to terminate at different rounds, igniting the study of protocols over point-to-point channels with probabilistic termination and expected constant round complexity. However, absent a rigorous simulation-based definition, the suggested protocols are proven secure in a property-based manner or via ad hoc simulation-based frameworks, therefore guaranteeing limited, if any, composability. In this work, we put forth the first simulation-based treatment of multi-party cryptographic protocols with probabilistic termination. We define secure multi-party computation (MPC) with probabilistic termination in the UC framework and prove a universal composition theorem for probabilistic termination protocols. Our theorem allows to compile a protocol using deterministic termination hybrids into a protocol that uses expected constant round protocols for emulating these hybrids, preserving the expected round complexity of the calling protocol. We showcase our definitions and compiler by providing the first composable protocols (with simulation-based security proofs) for the following primitives, relying on point-to-point channels: (1) expected constant round perfect Byzantine agreement, (2) expected constant round perfect parallel broadcast, and (3) perfectly secure MPC with round complexity independent of the number of parties. [ABSTRACT FROM AUTHOR]

In this paper, the sum rate of opportunistic interference alignment (OIA) is analyzed in multiple-input-multiple-output interfering broadcast channels. The alignment metric upon which users are scheduled is based on the chordal distance between certain interfering subspaces at each receiver, and the closed-form expressions for the rates of the scheduled users are derived. Furthermore, we show that for a system in which each user has $N$ receive antennas and the $j$ th base station transmits $d_{j}$ data streams, where $\sum _{j=1}^{I}d_{j}={N}+1$ and ${N}\ge 2$ , the rate for each user can be approximated by the mean of a Gumbel random variable. Further analysis reveals that if the number of users in cell $i$ scales as $\rho ^{\alpha }$ , where $\rho $ is the normalized transmit power and $\alpha \in [{0,1}]$ , then cell $i$ can achieve $\alpha d_{i}$ degrees of freedom. The simulation results confirm the validity of the theoretical analysis and the accuracy of the approximation. Thus, the sum rate analysis provided herein is an effective performance evaluation method for multi-cell OIA. [ABSTRACT FROM AUTHOR]

A visible light communication broadcast channel is considered, in which a transmitter luminaire communicates with two legitimate receivers in the presence of an external eavesdropper. A number of trusted cooperative half-duplex relay luminaires are deployed to aid with securing the transmitted data. Transmitters are equipped with single light fixtures, containing multiple light emitting diodes, and receiving nodes are equipped with single photo-detectors, rendering the considered setting as a single-input single-output system. Transmission is amplitude-constrained to maintain operation within the light emitting diodes’ dynamic range. Achievable secrecy rate regions are derived under such amplitude constraints for this multi-receiver wiretap channel, first for direct transmission without the relays, and then for multiple relaying schemes: cooperative jamming, decode-and-forward, and amplify-and-forward. Superposition coding with uniform signaling is used at the transmitter and the relays. Further, for each relaying scheme, secure beamforming vectors are carefully designed at the relay nodes in order to hurt the eavesdropper and/or benefit the legitimate receivers. Superiority of the proposed relaying schemes, with secure beamforming, is shown over direct transmission. It is also shown that the best relaying scheme depends on how far the eavesdropper is located from the transmitter and the relays, the number of relays, and their geometric layout. [ABSTRACT FROM AUTHOR]