English
Related papers

Related papers: Coding theory for noiseless channels realized by a…

200 papers

Applications of safety, security, and rescue in robotics, such as multi-robot target tracking, involve the execution of information acquisition tasks by teams of mobile robots. However, in failure-prone or adversarial environments, robots…

Robotics · Computer Science 2018-09-05 Brent Schlotfeldt , Vasileios Tzoumas , Dinesh Thakur , George J. Pappas

In this paper, we propose a novel partition reservation system to study the partition information and its transmission over a noise-free Boolean multi-access channel. The objective of transmission is not message restoration, but to…

Information Theory · Computer Science 2016-11-17 Shuhang Wu , Shuangqing Wei , Yue Wang , Ramachandran Vaidyanathan , Jian Yuan

Distributed computing models typically assume reliable communication between processors. While such assumptions often hold for engineered networks, e.g., due to underlying error correction protocols, their relevance to biological systems,…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-29 Ofer Feinerman , Bernhard Haeupler , Amos Korman

A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the energy expended in processing the data at the encoder and the decoder and…

Information Theory · Computer Science 2008-05-19 Pulkit Grover , Anant Sahai

This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…

Information Theory · Computer Science 2013-09-16 Fatemeh Hamidi-Sepehr , Henry D. Pfister , Jean-Francois Chamberland

We study the fundamental problem of reliable interactive communication over a noisy channel. In a breakthrough sequence of papers published in 1992 and 1993, Schulman gave non-constructive proofs of the existence of general methods to…

Data Structures and Algorithms · Computer Science 2011-04-06 Ran Gelles , Amit Sahai

We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with $n$ messages,…

Quantum Physics · Physics 2020-01-10 Debbie Leung , Ashwin Nayak , Ala Shayeghi , Dave Touchette , Penghui Yao , Nengkun Yu

In this paper, we explore the mystery of synchronous CDMA as applied to wireless and optical communication systems under very general settings for the user symbols and the signature matrix entries. The channel is modeled with real/complex…

Information Theory · Computer Science 2015-03-17 K. Alishahi , S. Dashmiz , P. Pad , F. Marvasti , M. H. Shafinia , M. Mansouri

In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…

Information Theory · Computer Science 2012-08-27 Peng Xu , Zhiguo Ding , and Xuchu Dai , Kin Leung

We consider a multi-way relay network with an orthogonal uplink and correlated sources, and we characterise reliable communication (in the usual Shannon sense) with a single-letter expression. The characterisation is obtained using a joint…

Information Theory · Computer Science 2013-09-18 Roy Timo , Gottfried Lechner , Lawrence Ong , Sarah J. Johnson

We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous…

Data Structures and Algorithms · Computer Science 2017-02-27 Keren Censor-Hillel , Ran Gelles , Bernhard Haeupler

In this paper, we study the circle formation problem by multiple autonomous and homogeneous disc-shaped robots (also known as fat robots). The goal of the robots is to place themselves on the periphery of a circle. Circle formation has many…

We consider a set of $n$ messages and a group of $k$ clients. Each client is privileged for receiving an arbitrary subset of the messages over a broadcast erasure channel, which generalizes scenario of a previous work. We propose a method…

Information Theory · Computer Science 2013-05-07 Shahriar Etemadi Tajbakhsh , Parastoo Sadeghi

We study the problem of multi-robot target assignment to minimize the total distance traveled by the robots until they all reach an equal number of static targets. In the first half of the paper, we present a necessary and sufficient…

Robotics · Computer Science 2014-08-01 Jingjin Yu , Soon-Jo Chung , Petros G. Voulgaris

Autonomous robot networks are an effective tool for monitoring large-scale environmental fields. This paper proposes distributed control strategies for localizing the source of a noisy signal, which could represent a physical quantity of…

Multiagent Systems · Computer Science 2014-04-14 Nikolay A. Atanasov , Jerome Le Ny , George J. Pappas

This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the…

Information Theory · Computer Science 2014-02-05 Victoria Kostina , Sergio Verdú

This paper investigates the role of communication in improving coordination within robot swarms, focusing on a paradigm where learning and execution occur simultaneously in a decentralized manner. We highlight the role communication can…

Codes are widely used in many engineering applications to offer robustness against noise. In large-scale systems there are several types of noise that can affect the performance of distributed machine learning algorithms -- straggler nodes,…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-01-30 Kangwook Lee , Maximilian Lam , Ramtin Pedarsani , Dimitris Papailiopoulos , Kannan Ramchandran

We study the throughput-delay performance tradeoff in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed to…

Information Theory · Computer Science 2009-08-31 Zhenning Kong , Edmund M. Yeh , Emina Soljanin

We consider the communication of natural language text from a source to a destination over noiseless and character-erasure channels. We exploit language's inherent correlations and predictability to constrain transmission costs by allowing…

Information Theory · Computer Science 2024-03-04 Bhavani A Madhabhavi , Gangadhar Karevvanavar , Rajshekhar V Bhat , Nikolaos Pappas
‹ Prev 1 8 9 10 Next ›