Communicating over the torn-paper channel

Ilan Shomorony, Alireza Vahid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of communicating over a channel that randomly 'tears' the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length n and pieces of length Geometric(pn), we characterize the capacity as C = e-α, where α= lim n→∞Pn, Our results show that the case of Geometric (Pn)-length fragments and the case of deterministic length-(1/Pn) fragments are qualitatively different and, surprisingly, the capacity of the former is larger. Intuitively, this is due to the fact that, in the random fragments case, large fragments are sometimes observed, which boosts the capacity.

Original languageEnglish (US)
Title of host publication2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728182988
DOIs
StatePublished - Dec 2020
Event2020 IEEE Global Communications Conference, GLOBECOM 2020 - Virtual, Taipei, Taiwan, Province of China
Duration: Dec 7 2020Dec 11 2020

Publication series

Name2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
Volume2020-January

Conference

Conference2020 IEEE Global Communications Conference, GLOBECOM 2020
CountryTaiwan, Province of China
CityVirtual, Taipei
Period12/7/2012/11/20

ASJC Scopus subject areas

  • Media Technology
  • Modeling and Simulation
  • Instrumentation
  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Communicating over the torn-paper channel'. Together they form a unique fingerprint.

Cite this