Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

Proceedings of the IEEE

Issue 3 • March 2011

Filter Results

Displaying Results 1 - 19 of 19
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (747 KB)
    Freely Available from IEEE
  • Proceedings of the IEEE publication information

    Publication Year: 2011, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Special issue on Network Coding - Table of contents

    Publication Year: 2011, Page(s):357 - 358
    Request permission for commercial reuse | PDF file iconPDF (398 KB)
    Freely Available from IEEE
  • Planetary Defense and an Energy Infrastructure for Near Earth Space [Point of View]

    Publication Year: 2011, Page(s):359 - 362
    Request permission for commercial reuse | PDF file iconPDF (326 KB) | HTML iconHTML
    Freely Available from IEEE
  • Network Coding [Scanning the issue]

    Publication Year: 2011, Page(s):363 - 365
    Request permission for commercial reuse | PDF file iconPDF (124 KB) | HTML iconHTML
    Freely Available from IEEE
  • Network Coding: A Historical Perspective

    Publication Year: 2011, Page(s):366 - 371
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (381 KB) | HTML iconHTML

    Ten years ago, Ahlswede, Cai, Li, and Yeung refuted the folklore that information can be regarded as a commodity in network communication by means of an example now known as the butterfly network. The concept of network coding was formulated, and the fundamental max-flow-min-cut theorem for information flow was established. Since then, the work has generated much interest among many different rese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Network Coding: Theory and Algorithms

    Publication Year: 2011, Page(s):372 - 387
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1856 KB) | HTML iconHTML

    Network coding is a new paradigm in data transport that combines coding with data propagation over a network. Theory of linear network coding (LNC) adopts a linear coding scheme at every node of the network and promises the optimal data transmission rate from the source to all receivers. Linearity enhances the theoretic elegance and engineering simplicity, which leads to wide applicability. This p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Coding and Matroid Theory

    Publication Year: 2011, Page(s):388 - 405
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (418 KB) | HTML iconHTML

    Networks derived from matroids have played a fundamental role in proving theoretical results about the limits of network coding. In this tutorial paper, we review many connections between matroids and network coding theory, with specific emphasis on network solvability, admissible network alphabet sizes, linear coding, and network capacity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory and Applications of Network Error Correction Coding

    Publication Year: 2011, Page(s):406 - 420
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    Network error correction coding (NEC) has attracted a lot of attention in recent years because of its potential usefulness in network communications. Several kinds of errors may occur in communication networks using network coding. This includes random errors, erasures, and errors caused by attacks from malicious nodes. The main goal of the theory of NEC is to deal with these errors efficiently. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory of Secure Network Coding

    Publication Year: 2011, Page(s):421 - 437
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    In this tutorial paper, we focus on the basic theory of linear secure network coding. Our goal is to present fundamental results and provide preliminary knowledge for anyone interested in the area. We first present a model for secure network coding and then a necessary and sufficient condition for a linear network code to be secure. Optimal methods to construct linear secure network codes are also... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable Physical Layer Network Coding

    Publication Year: 2011, Page(s):438 - 460
    Cited by:  Papers (168)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (933 KB) | HTML iconHTML

    When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This property of the wireless medium is typically viewed as a hindrance to reliable communication over a network. However, using a recently developed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Coding: Beyond Throughput Benefits

    Publication Year: 2011, Page(s):461 - 475
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB) | HTML iconHTML

    Network coding enables novel network functionalities and thus offers a wider canvas of choices when optimizing an information flow problem. In this paper, we examine the simplest possible information flow problem, a unicast connection, and explore what we believe is one of the most attractive features network coding offers: the ability to enable near-optimal performance in a completely decentraliz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Survey on Network Codes for Distributed Storage

    Publication Year: 2011, Page(s):476 - 489
    Cited by:  Papers (200)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1080 KB) | HTML iconHTML

    Distributed storage systems often introduce redundancy to increase reliability. When coding is used, the repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node. This amounts to a partial recovery of the code, whereas conventional erasure coding focuses on the complete recovery of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Coding Meets TCP: Theory and Implementation

    Publication Year: 2011, Page(s):490 - 512
    Cited by:  Papers (88)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (835 KB) | HTML iconHTML

    The theory of network coding promises significant benefits in network performance, especially in lossy networks and in multicast and multipath scenarios. To realize these benefits in practice, we need to understand how coding across packets interacts with the acknowledgment (ACK)-based flow control mechanism that forms a central part of today's Internet protocols such as transmission control proto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random Network Coding in Peer-to-Peer Networks: From Theory to Practice

    Publication Year: 2011, Page(s):513 - 523
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (347 KB) | HTML iconHTML

    With random network coding, network nodes between the source and receivers are able to not only relay and replicate data packets, but also code them using randomly generated coding coefficients. From a theoretical perspective, it has been recognized that network coding maximizes the network flow rates in multicast sessions in directed acyclic network graphs. To date, random network coding has seen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Electrical Engineering Hall of Fame: Rudolf Kompfner [Scanning Our Past]

    Publication Year: 2011, Page(s):524 - 526
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    The IEEE selected Rudolf Kompfner as the recipient of its 1973 Medal of Honor, "for a major contribution to world-wide communication through the conception of the traveling wave tube embodying a new principle of amplification." In addition, he contributed to the development of communication systems using earth satellites. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Future Special Issues/Special Sections of the Proceedings

    Publication Year: 2011, Page(s):527 - 528
    Request permission for commercial reuse | PDF file iconPDF (155 KB)
    Freely Available from IEEE
  • Are you keeping up with technology or falling behind [advertisement]

    Publication Year: 2011, Page(s): C3
    Request permission for commercial reuse | PDF file iconPDF (508 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2011, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (430 KB)
    Freely Available from IEEE

Aims & Scope

The most highly-cited general interest journal in electrical engineering and computer science, the Proceedings is the best way to stay informed on an exemplary range of topics.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
H. Joel Trussell
North Carolina State University