Please use this identifier to cite or link to this item: http://hdl.handle.net/10071/13057
Author(s): Monteiro, F. A.
Burr, A.
Chatzigeorgiou, I.
Camilla, H.
Krikidis, I.
Seferoglu, H.
Skachek, V.
Date: 2017
Title: Editorial - Special issue on network coding
Volume: 2017
Number: 1
Pages: 1 - 3
ISSN: 1687-6180
DOI (Digital Object Identifier): 10.1186/s13634-017-0463-2
Keywords: Network Coding
Abstract: Future networks are expected to depart from traditional routing schemes in order to embrace network coding (NC) based schemes. These have created a lot of interest both in academia and industry in recent years. Under the NC paradigm, symbols are transported through the network by combining several information streams originating from the same or different sources. This special issue contains thirteen papers, some dealing with design aspects of NC and related concepts (e.g., fountain codes), and some showcasing the application of NC to new services and technologies, such as data multi-view streaming of video or underwater sensor networks. One can find papers that show how NC turns data transmission more robust to packet losses, faster to decode, and more resilient to network changes, such as dynamic topologies and different user options, and how NC can improve the overall throughput. This issue also includes papers showing that NC principles can be used at different layers of the networks (including the physical layer) and how the same fundamental principles can lead to new distributed storage systems. Some of the papers in this issue have a theoretical nature, including code design, while others describe hardware testbeds and prototypes.
Peerreviewed: no
Access type: Open Access
Appears in Collections:IT-OPI - Outras publicações internacionais

Files in This Item:
File Description SizeFormat 
Editorial NC EURASIP JASP Springer 2017.pdf295,86 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.