Filters








1,067 Hits in 5.6 sec

Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback [article]

Klim Efremenko, Ran Gelles, Bernhard Haeupler
2015 arXiv   pre-print
We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback.  ...  We also consider interactive communication over erasure channels.  ...  Interactive communication over channels with feedback and erasure channels.  ... 
arXiv:1501.00624v1 fatcat:gitj6hr4gvesjcpi66j57nc3oa

On interactive secrecy over erasure networks

Laszlo Czap, Vinod M. Prabhakaran, Suhas Diggavi, Christina Fragouli
2012 2012 5th International Symposium on Communications, Control and Signal Processing  
In this short review paper we summarize some of our recent results on interactive message secrecy for broadcast erasure channels.  ...  This implies that for the purposes of this paper, communication takes place over a 1-to-K broadcast erasure channel.  ...  The secret key generation capacity of the broadcast erasure channel with state-feedback is C SK = δ E (1 − δ 1 )L log q. (4) Theorem 2.  ... 
doi:10.1109/isccsp.2012.6217871 dblp:conf/isccsp/CzapPDF12 fatcat:tgi6pkacuzfujac4ubxjjz332u

Coding for Interactive Communication: A Survey

Ran Gelles
2017 Foundations and Trends® in Theoretical Computer Science  
In particular, we survey coding schemes for channels that allow a noiseless feedback, erasure channels, channels with insertions and deletions, and quantum channels.  ...  We also discuss the maximal possible rate, that is, the capacity of interactive communication over memoryless noisy channels. Section 6 explores other types of noisy channels.  ... 
doi:10.1561/0400000079 fatcat:ohqgd4wu7fa5bkrgvfm7o4rrbq

Reverse Coherent Information

Raúl García-Patrón, Stefano Pirandola, Seth Lloyd, Jeffrey H. Shapiro, Alexander Lvovsky
2009 AIP Conference Proceedings  
In this Letter we define a family of entanglement distribution protocols assisted by feedback classical communication that gives an operational interpretation to reverse coherent information, i.e., the  ...  This leads to the definition of a new entanglement distribution capacity that exceeds the unassisted capacity for some interesting channels.  ...  By analogy with Shannon's theory, one would expect QðÃÞ to be calculated by maximizing over a single use of the channel, Q ð1Þ ðÃÞ ¼ max A IðÃ; A Þ: (3) Unfortunately, the quantum case is more complicated  ... 
doi:10.1063/1.3131378 fatcat:246fyg6gobej7aqmojinon4cnm

Reverse Coherent Information

Raúl García-Patrón, Stefano Pirandola, Seth Lloyd, Jeffrey H. Shapiro
2009 Physical Review Letters  
In this letter we define a family of entanglement distribution protocols assisted by feedback classical communication that gives an operational interpretation to reverse coherent information, i.e., the  ...  This lead to the definition of a new entanglement distribution capacity that exceeds the unassisted capacity for some interesting channels.  ...  By analogy with Shannon's theory, one would expect QðÃÞ to be calculated by maximizing over a single use of the channel, Q ð1Þ ðÃÞ ¼ max A IðÃ; A Þ: (3) Unfortunately, the quantum case is more complicated  ... 
doi:10.1103/physrevlett.102.210501 pmid:19519088 fatcat:a5egrscnqvel3a4k3pm35pyqfu

Interactive Coding Resilient to an Unknown Number of Erasures

Ran Gelles, Siddharth Iyer, Michael Wagner
2020 International Conference on Principles of Distributed Systems  
Our coding schemes are efficient, deterministic, have linear overhead both in their communication and round complexity, and succeed (with probability 1) regardless of the number of erasures T .  ...  We develop interactive coding schemes that adapt to the actual level of noise and correctly execute any two-party computation.  ...  The maximal noise for erasure channels with binary or ternary alphabet is still open.  ... 
doi:10.4230/lipics.opodis.2019.13 dblp:conf/opodis/GellesI19 fatcat:fxrhlthmz5awhj6xbdvbzglxum

Usefulness of entanglement-assisted quantum metrology

Zixin Huang, Chiara Macchiavello, Lorenzo Maccone
2016 Physical Review A  
This is known to be useless in the noiseless case, but was recently shown to be useful in the presence of noise. Here we detail how and when it can be of use.  ...  Entanglement-assisted quantum communication employs pre-shared entanglement between sender and receiver as a resource.  ...  for the erasure, amplitude damping and depolarizing noise models which commute with U ϕ .  ... 
doi:10.1103/physreva.94.012101 fatcat:3omjjeskxnagrm63n5vvusysiu

Comments on unknown channels

Kristen Woyach, Kate Harrison, Gireeja Ranade, Anant Sahai
2012 2012 IEEE Information Theory Workshop  
This paper builds on his line of thought to consider priority encoding of communication over unknown channels without feedback, using fixed-length codes and from a single-shot, individual channel perspective  ...  The idea of modeling an unknown channel using a broadcast channel was first introduced by Cover 1 in 1972.  ...  NSF (CNS-403427, CNS-0932410 and Graduate Fellowships) for their generous funding support and the reviewers for their comments.  ... 
doi:10.1109/itw.2012.6404651 dblp:conf/itw/WoyachHRS12 fatcat:anxdcz7fdvhmrb4z2kwhq6muje

The Necessity and Sufficiency of Anytime Capacity for Stabilization of a Linear System Over a Noisy Communication Link—Part I: Scalar Systems

A. Sahai, S. Mitter
2006 IEEE Transactions on Information Theory  
A consequence of this necessity result is a sequential generalization of the Schalkwijk-Kailath scheme for communication over the additive white Gaussian noise (AWGN) channel with feedback.  ...  In this paper, we review how Shannon's classical notion of capacity is not enough to characterize a noisy communication channel if the channel is intended to be used as part of a feedback loop to stabilize  ...  They thank Nicola Elia for several constructive discussions about the subject matter of this paper and Sekhar Tatikonda for many discussions over a long period of time which have influenced this work in  ... 
doi:10.1109/tit.2006.878169 fatcat:dqphgtzve5a2na6slzjpy6ln6m

Optimal Coding for Streaming Authentication and Interactive Communication [chapter]

Matthew Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman
2013 Lecture Notes in Computer Science  
In this work we suggest a constant-rate error-correction scheme and an efficient authentication scheme for data streams over a noisy channel (one-way communication, no feedback) in the shared-randomness  ...  Our techniques also apply to the task of interactive communication (two-way communication) over a noisy channel.  ...  In the interactive communication scenario, two parties perform an arbitrary interactive protocol over a noisy channel, while keeping the amount of exchanged data only a constant factor more than an equivalent  ... 
doi:10.1007/978-3-642-40084-1_15 fatcat:ednvxg7lbvdmzgehrbgvbwxeye

Unequal Error Protection: An Information-Theoretic Perspective

Shashi Borade, Baris Nakiboglu, Lizhong Zheng
2009 IEEE Transactions on Information Theory  
It is shown that, feedback results in a significant improvement in both bit-wise and message-wise UEP (except the single message case for missed detection).  ...  The fundamental difference between the bit-wise and message-wise unequal error protection (UEP) is demonstrated, for fixed length block codes on DMCs without feedback.  ...  Helpful discussions with David Forney and Emre Telatar are also gratefully acknowledged.  ... 
doi:10.1109/tit.2009.2032819 fatcat:crjslvzni5cx7n27zc5vmaipxm

The necessity and sufficiency of anytime capacity for stabilization of a linear system over a noisy communication link Part I: scalar systems [article]

Anant Sahai, Sanjoy Mitter
2006 arXiv   pre-print
A consequence of this necessity result is a sequential generalization of the Schalkwijk/Kailath scheme for communication over the AWGN channel with feedback.  ...  We close with comments discussing a hierarchy of difficulty for communication problems and how these results establish where stabilization problems sit in that hierarchy.  ...  We thank Nicola Elia for several constructive discussions about the subject matter of this paper and Sekhar Tatikonda for many discussions over a long period of time which have influenced this work in  ... 
arXiv:cs/0601007v1 fatcat:clyhsa5zkfax5dgib5jfmrmsye

Interactive coding resilient to an unknown number of erasures [article]

Ran Gelles, Siddharth Iyer
2019 arXiv   pre-print
Our coding schemes are efficient, deterministic, have linear overhead both in their communication and round complexity, and succeed (with probability 1) regardless of the number of erasures T.  ...  We develop interactive coding schemes that adapt to the actual level of noise and correctly execute any two-party computation.  ...  Research supported in part by the Israel Science Foundation (ISF) through grant No. 1078/17.  ... 
arXiv:1811.02527v2 fatcat:4ul2hbszabfxjmy6fbbwl6h6wi

Balancing forward and feedback error correction for erasure channels with unreliable feedback [article]

Anant Sahai
2007 arXiv   pre-print
Here, packet-erasure channels are considered on both the forward and feedback links.  ...  First, the feedback channel is considered as a given and a strategy is given to balance forward and feedback error correction in the suitable information-theoretic limit of long end-to-end delays.  ...  Schulman and others have studied interaction over noisy channels in the context of distributed computation [7] , [8] .  ... 
arXiv:0712.0871v1 fatcat:jq5p6bywyjhs3kvuv6pdo26blm

Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach [article]

Sreeram Kannan, Pramod Viswanath
2011 arXiv   pre-print
Our formal result is in the context of channel models for which "good" local schemes, that achieve the cut-set bound, exist (such as Gaussian MAC and broadcast channels, broadcast erasure networks, fast  ...  Feedback is shown to play a critical role in enabling the separation between the physical and the network layers.  ...  Acknowledgements The authors would like to thank Chandra Chekuri and Adnan Raja for several useful discussions.  ... 
arXiv:1111.4768v1 fatcat:z4ewzy6n7rbupccwbxyhqysfha
« Previous Showing results 1 — 15 out of 1,067 results