English
Related papers

Related papers: Notes on Bit-reversal Broadcast Scheduling

200 papers

We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. One of our main motivations is to address the question whether simply placing quantum memories along a…

Quantum Physics · Physics 2022-03-22 Lars Kamin , Evgeny Shchukin , Frank Schmidt , Peter van Loock

We discuss distributed reframing control of bittide systems. In a bittide system, multiple processors synchronize by monitoring communication over the network. The processors remain in logical synchrony by controlling the timing of frame…

Systems and Control · Electrical Eng. & Systems 2023-03-22 Sanjay Lall , Calin Cascaval , Martin Izzard , Tammo Spalink

Belief Propagation (BP) is a message-passing algorithm for approximate inference over Probabilistic Graphical Models (PGMs), finding many applications such as computer vision, error-correcting codes, and protein-folding. While general, the…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-09-26 Mark Van der Merwe , Vinu Joseph , Ganesh Gopalakrishnan

We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…

Information Theory · Computer Science 2022-05-04 Dmitriy Kim , Georgi Georgiev , Natalya Markovskaya

Generation and prediction of time series is analyzed for the case of a Bit-Generator: a perceptron where in each time step the input units are shifted one bit to the right with the state of the leftmost input unit set equal to the output…

Condensed Matter · Physics 2016-08-31 E. Eisenstein , I. Kanter , D. A. Kessler , W. Kinzel

The paper treats uplink scenario where M user equipments (UEs) send to a Base Station (BS), possibly via a common Relay Station (RS) that is equipped with a buffer. This is a multiple-access relay channel (MARC) aided by a buffer. We devise…

Information Theory · Computer Science 2016-11-17 Rongkuan Liu , Petar Popovski , Gang Wang

We propose a prepare-and-measure scheme for quantum key distribution with 2-bit quantum codes. The protocol is unconditionally secure under whatever type of intercept-and-resend attack. Given the symmetric and independent errors to the…

Quantum Physics · Physics 2009-11-10 Xiang-Bin Wang

Next generation wireless communications rely on multiple input multiple output (MIMO) techniques to achieve high data rates. Feedback of channel information can be used in MIMO precoding to fully activate the strongest channel modes and…

Information Theory · Computer Science 2010-08-19 C. Jiang , M. Wang , C. Yang

We study a $K$-user coded-caching broadcast problem in a joint source-channel coding framework. The transmitter observes a database of files that are being generated at a certain rate per channel use, and each user has a cache, which can…

Information Theory · Computer Science 2023-10-13 Hadi Reisizadeh , Mohammad Ali Maddah-Ali , Soheil Mohajer

This paper presents a novel system architecture for hybrid satellite communications, integrating quantum key distribution (QKD) and classical radio frequency (RF) data transmission using a dual-band reconfigurable intelligent surface (RIS).…

Signal Processing · Electrical Eng. & Systems 2025-07-08 Muhammad Khalil , Ke Wang , Jinho Choi

We consider a setting of non-cooperative communication where a receiver wants to recover randomly generated sequences of symbols that are observed by a strategic sender. The sender aims to maximize an average utility that may not align with…

Information Theory · Computer Science 2025-03-03 Anuj S. Vora , Ankur A. Kulkarni

Broadcasting algorithms are of fundamental importance for distributed systems engineering. In this paper we revisit the classical and well-studied push protocol for message broadcasting. Assuming that initially only one node has some piece…

Combinatorics · Mathematics 2009-05-01 Nikolaos Fountoulakis , Anna Huber , Konstantinos Panagiotou

A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with messages intended…

Information Theory · Computer Science 2020-11-11 Henry Romero , Mahesh K. Varanasi

We consider a Multiple Input Single Output (MISO) point-to-point communication system in which the transmitter is designed such that, each antenna can transmit information or harvest energy at any given point in time. We evaluate the…

Information Theory · Computer Science 2018-03-22 Y. Ozan Basciftci , Amr Abdelaziz , C. Emre Koksal

This paper investigates joint device identification, channel estimation, and symbol detection for LEO satellite-enabled grant-free random access systems, specifically targeting scenarios where remote Internet-of-Things (IoT) devices operate…

Information Theory · Computer Science 2024-12-31 Boxiao Shen , Yongpeng Wu , Wenjun Zhang , Symeon Chatzinotas , Björn Ottersten

In this paper, link selection for half-duplex buffer-aided relay systems is revisited. A new fixed scheduling policy referred as alternate distributed beamforming (ADB) is proposed, in which the relays are divided into two groups, with one…

Information Theory · Computer Science 2019-10-10 Jiayu Zhou , Deli Qiao

We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by…

Information Theory · Computer Science 2024-04-19 Radosław Kotaba , Roope Vehkalahti , Čedomir Stefanović , Olav Tirkkonen , Petar Popovski

An efficient scheme for initial ranging has recently been proposed by X. Fu et al. in the context of orthogonal frequency-division multiple-access (OFDMA) networks based on the IEEE 802.16e-2005 standard. The proposed solution aims at…

Information Theory · Computer Science 2016-11-17 Luca Sanguinetti , Michele Morelli , H. Vincent Poor

Many black-box optimization tasks arising in high-stakes applications require risk-averse decisions. The standard Bayesian optimization (BO) paradigm, however, optimizes the expected value only. We generalize BO to trade mean and…

Machine Learning · Computer Science 2021-11-10 Anastasiia Makarova , Ilnura Usmanova , Ilija Bogunovic , Andreas Krause

We consider covert communication using a queuing timing channel in the presence of a warden. The covert message is encoded using the inter-arrival times of the packets, and the legitimate receiver and the warden observe the inter-departure…

Information Theory · Computer Science 2016-08-17 Pritam Mukherjee , Sennur Ulukus
‹ Prev 1 8 9 10 Next ›