A code over finite alphabet is said to be locally recoverable (LRC) if each code symbol is function of small number of other symbols forming the recovering set [1], [2], [3], [4], [5]. These codes were first proposed ...
详细信息
ISBN:
(纸本)9781728104317
A code over finite alphabet is said to be locally recoverable (LRC) if each code symbol is function of small number of other symbols forming the recovering set [1], [2], [3], [4], [5]. These codes were first proposed in [1] and immediate become popular due to obvious applications in distributed and cloud storage systems. Natural generalization of LRC codes is LRC codes with availability in which each code symbol has more than one disjoint recovering set. A LRC codes with availability is said to be optimal if its minimum distance achieves the Singleton-like bound developed by Kruglik et. al in this paper we study the maximum code length of q-ary optimal LRC with availability and then derive some structural properties.
Reliable communication in massive random access scenarios with short packet transmissions requires integration of novel network architecture solutions and multiple access methods. In this paper, we study the performan...
详细信息
ISBN:
(纸本)9781538649206
Reliable communication in massive random access scenarios with short packet transmissions requires integration of novel network architecture solutions and multiple access methods. In this paper, we study the performance of an uncoordinated, grant-free random access scheme based on compute-and-forward (CoF) in a dense cloud radio access network (C-RAN) where multiple access points (out-of-band relays or radio units) are connected by low-rate links to a central processing instance. The access points decode linear equations of transmitted messages and forward these to the central processing instance, which solves for the original messages. In the context of the C-RAN architecture, the approach provides efficient utilization of the (limited) fronthaul resources, thus presenting an alternative to conventional C-RAN implementations. The performance of the CoF-based scheme is assessed in a realistic scenario where neither the transmit nor the receive instances have a priori channel state information (CSI). In our approach, pilot signals and data are transmitted in the same message, which meets a strong need for the integration of control and data for short message transmissions. An important aspect that we study is the trade-off between the resource allocation for reliable channel estimation and encoded data transmission given a reliability target.
This paper addresses the linear dependency problem that arises in random linear network coding (RLNC) when a small field size is used. We show that, by appropriate precoding with maximum-rank-distance (MRD) codes, the...
详细信息
We introduce a family of sparse random linear network codes with outer-code. Due to the bold role of the incomplete gamma function in their design, we call these codes "Gamma codes". We show that Gamma codes...
详细信息
This paper discusses the application of random network coding safety problems, when transfering files, and Puts forward an algorithm that targets eavesdropping adversaries By means of this algorithm, an eavesdropper i...
详细信息
With the rapid growth of Internet of Things (IoT), the idea of integrating a variety of IoTs has been proposed to support a variety of novel applications. However, IoT devices are often deployed in an open environment...
详细信息
ISBN:
(纸本)9781538647905
With the rapid growth of Internet of Things (IoT), the idea of integrating a variety of IoTs has been proposed to support a variety of novel applications. However, IoT devices are often deployed in an open environment in which IoTs are inclined to be malfunctioned. Although data reliability can be achieved by data recovery with conventional replication, the communication between IoTs is susceptible to eavesdropping. Since most of the current work focuses on designing the architectures for IoTs under the specific scenarios, the eavesdropping prevention for heterogeneous IoT systems remains unexplored. Therefore, in this paper, we consider using the network-coding-based distributed storage systems for security and show that repair bandwidth can be reduced by increasing storage per node. Moreover, we theoretically derive the relation between repair bandwidth and storage in heterogeneous IoT systems. Finally, we show the relation between storage cost and reliability with regard to different amounts of IoT devices.
In resource-limited wireless sensor networks(WSNs), network resource will run out soon due to communication of mass redundant data. We employ network coding as an effective in-network processing strategy to reduce the...
详细信息
It is significant to develop a method to realize efficient broadcast transmission in wireless broadcasting networks that suffer from the fading of wireless channels. network coding provides a magnificent prospect in t...
详细信息
We consider the encoding complexity of two simple multicast network coding problem (2-SMNC). The network is a directed acyclic graph, where two messages are required to send from two sources to two groups of sinks res...
详细信息
The deep learning trend has recently impacted a variety of fields, including communication systems, where various approaches have explored the application of neural networks in place of traditional designs. Neural net...
详细信息
暂无评论