Skip to main content
Book cover

Open Problems in Communication and Computation

  • Book
  • © 1987

Overview

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (59 chapters)

  1. Introduction

  2. FRACTRAN

  3. Problems in Communication

Keywords

About this book

Thomas M. Cover and B. Gopinatb The papers in this volume are the contributions to a special workshop on problems in communication and computation conducted in the summers of 1984 and 1985 in Morristown, New Jersey, and the summer of 1986 in Palo Alto. California. The structure of this workshop was unique: no recent results. no surveys. Instead. we asked for outstanding open prob~ lems in the field. There are many famous open problems, including the question P = NP?, the simplex conjecture in communication theory, the capacity region of the broadcast channel. and the two·helper problem in information theory. Beyond these well-defined problems are certain grand research goals. What is the general theory of information flow in stochastic networks? What is a comprehensive theory of computational complexity? What about a unification of algorithmic complexity and computational complex­ ity? Is there a notion of energy-free computation? And if so, where do information theory, communication theory, computer science, and physics meet at the atomic level? Is there a duality between computation and communication? Finally. what is the ultimate impact of algorithmic com­ plexity on probability theory? And what is its relationship to information theory? The idea was to present problems on the first day. try to solve them on the second day, and present the solutions on the third day. In actual fact, only one problem was solved during the meeting -- El Gamal's prob· lem on noisy communication over a common line.

Editors and Affiliations

  • Departments of Electrical Engineering and Statistics, Stanford University, Stanford, USA

    Thomas M. Cover

  • Systems Principles Research, Bell Communications Research, Morristown, USA

    B. Gopinath

Bibliographic Information

  • Book Title: Open Problems in Communication and Computation

  • Editors: Thomas M. Cover, B. Gopinath

  • DOI: https://doi.org/10.1007/978-1-4612-4808-8

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag New York Inc. 1987

  • Softcover ISBN: 978-1-4612-9162-6

  • eBook ISBN: 978-1-4612-4808-8

  • Edition Number: 1

  • Number of Pages: VIII, 236

  • Topics: Coding and Information Theory

Publish with us