Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.7
2.7
Journals
Entropy
Special Issues
Information Theory and Network Coding
entropy-logo
Submit to Entropy Review for Entropy Propose a Special Issue

Journal Menu

► Journal Menu

Journal Browser

► Journal Browser
share announcement

Information Theory and Network Coding

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: closed (31 January 2020) | Viewed by 6467

Special Issue Editors

Dr. Parastoo Sadeghi

E-Mail Website
Guest Editor
Research School of Electrical, Energy and Materials Engineering, College of Engineering and Computer Science, Australian National University, Canberra, ACT 2601, Australia
Interests: information theory and practical schemes for network coding and index coding; cooperative data exchange; throughput-delay tradeoff
Dr. Neda Aboutorab

E-Mail Website
Guest Editor
School of Engineering and Information Technology, University of New South Wales, Canberra, ACT 2612, Australia
Interests: network coding; applied information theory; coding for data caching and storage systems; cooperative communications; cross-layer communications

Special Issue Information

Dear Colleagues,

The year 2020 marks twenty years since the publication of the landmark paper in network coding, “Network Information Flow” by R. Ahlswede, N. Cai, S.-Y.R. Li and R.W. Yeung. Over the past two decades, network coding has played a transformational role in information theory, shaped our understating of fundamental performance limits of wired and wireless data networks and produced elegant techniques for achieving them.

This Special Issue aims to bring together a body of recent research in network coding, promote its applications and underscore the important role it continues to play in advancing information theory. We welcome unpublished original contributions to the theory and practice of network coding. Topics of interest include, but are not limited to, the following:

  • Fundamental performance bounds or achievability results in information theory via network coding
  • Complexity results in information theory via network coding
  • Network coding theory and techniques
  • Index coding theory and techniques
  • Performance characterization and optimization of practical network coding schemes
  • Secure, secret or private network coding and index coding
  • Network coding for distributed coded computations, caching or storage
  • Network coding for communication for omniscience (also known as cooperative data exchange)
  • Network coding for edge computing
  • Network coding for wireless, cellular or vehicular communication networks 


Dr. Parastoo Sadeghi
Dr. Neda Aboutorab
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (2 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

57 pages, 627 KiB  
Article
A Protocol Design Paradigm for Batched Sparse Codes
by Hoover H. F. Yin, Raymond W. Yeung and Shenghao Yang
Entropy 2020, 22(7), 790; https://doi.org/10.3390/e22070790 - 20 Jul 2020
Cited by 12 | Viewed by 2963
Abstract
Internet of Things (IoT) connects billions of everyday objects to the Internet. The mobility of devices can be facilitated by means of employing multiple wireless links. However, packet loss is a common phenomenon in wireless communications, where the traditional forwarding strategy undergoes severe [...] Read more.
Internet of Things (IoT) connects billions of everyday objects to the Internet. The mobility of devices can be facilitated by means of employing multiple wireless links. However, packet loss is a common phenomenon in wireless communications, where the traditional forwarding strategy undergoes severe performance issues in a multi-hop wireless network. One solution is to apply batched sparse (BATS) codes. A fundamental difference from the traditional strategy is that BATS codes require the intermediate network nodes to perform recoding, which generates recoded packets by network coding operations. Literature showed that advanced recoding schemes and burst packet loss can enhance and diminish the performance of BATS codes respectively. However, the existing protocols for BATS codes cannot handle both of them at the same time. In this paper, we propose a paradigm of protocol design for BATS codes. Our design can be applied in different layers of the network stack and it is compatible to the existing network infrastructures. The modular nature of the protocol can support different recoding techniques and different ways to handle burst packet loss. We also give some examples to demonstrate how to use the protocol. Full article
(This article belongs to the Special Issue Information Theory and Network Coding)
►▼ Show Figures

Figure 1

34 pages, 897 KiB  
Article
On NACK-Based rDWS Algorithm for Network Coded Broadcast
by Sovanjyoti Giri and Rajarshi Roy
Entropy 2019, 21(9), 905; https://doi.org/10.3390/e21090905 - 17 Sep 2019
Cited by 3 | Viewed by 2914
Abstract
The Drop when seen (DWS) technique, an online network coding strategy is capable of making a broadcast transmission over erasure channels more robust. This throughput optimal strategy reduces the expected sender queue length. One major issue with the DWS technique is the high [...] Read more.
The Drop when seen (DWS) technique, an online network coding strategy is capable of making a broadcast transmission over erasure channels more robust. This throughput optimal strategy reduces the expected sender queue length. One major issue with the DWS technique is the high computational complexity. In this paper, we present a randomized version of the DWS technique (rDWS), where the unique strength of the DWS, which is the sender’s ability to drop a packet even before its decoding at receivers, is not compromised. Computational complexity of the algorithms is reduced with rDWS, but the encoding is not throughput optimal here. So, we perform a throughput efficiency analysis of it. Exact probabilistic analysis of innovativeness of a coefficient is found to be difficult. Hence, we carry out two individual analyses, maximum entropy analysis, average understanding analysis, and obtain a lower bound on the innovativeness probability of a coefficient. Based on these findings, innovativeness probability of a coded combination is analyzed. We evaluate the performance of our proposed scheme in terms of dropping and decoding statistics through simulation. Our analysis, supported by plots, reveals some interesting facts about innovativeness and shows that rDWS technique achieves near-optimal performance for a finite field of sufficient size. Full article
(This article belongs to the Special Issue Information Theory and Network Coding)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-2
Back to TopTop