Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this wo...
详细信息
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions for the existence of MSRD codes with a support-constrained generator matrix. The conditions on the support constraints are identical to those for MDS codes and MRD codes. The required field size for an [n, k](q)(m) LRS codes with support-constrained generator matrix is q >= l+1 and m >= max(l is an element of[l]){k-1+log(q) k,n(l)} , where l is the number of blocks and n(l) is the size of the l-th block. The special cases of the result coincide with the known results for Reed-Solomon codes and Gabidulin codes. For the support constraints that do not satisfy the necessary conditions, we derive the maximum sum-rank distance of a code whose generator matrix fulfills the constraints. Such a code can be constructed from a subcode of an LRS code with a sufficiently large field size. Moreover, as an application in networkcoding, the conditions can be used as constraints in an integer programming problem to design distributed LRS codes for a distributed multi-sourcenetwork.
It has been proven that networkcoding can provide significant benefits to networks. However, networkcoding is very vulnerable to pollution attacks. In recent years, many schemes have been designed to defend against ...
详细信息
It has been proven that networkcoding can provide significant benefits to networks. However, networkcoding is very vulnerable to pollution attacks. In recent years, many schemes have been designed to defend against these attacks, but as far as we know almost all of them are inapplicable for multi-source network coding system. This paper proposed a novel homomorphic signature scheme based on bilinear pairings to stand against pollution attacks for multi-source network coding, which has a broader application background than single-sourcenetworkcoding. Our signatures are publicly verifiable and the public keys are independent of the files so that our scheme can be used to authenticate multiple files without having to update public keys. The signature length of our proposed scheme is as short as the shortest signatures of a single-sourcenetworkcoding. The verification speed of our scheme is faster than those signature schemes based on elliptic curves in the single-sourcenetwork. (C) 2011 Elsevier B.V. All rights reserved.
networkcoding can make the intermediate nodes encode the messages, and it has the merits of large network throughput, high resource utilization rate and strong system robustness. Traditional certificateless ring sign...
详细信息
networkcoding can make the intermediate nodes encode the messages, and it has the merits of large network throughput, high resource utilization rate and strong system robustness. Traditional certificateless ring signcryption cannot be used in the networkcoding environment, so we construct one certificateless ring signcryption for multi-source network coding (MSNC-CLRSC), in which actual signcrypter can anonymously signcrypt a message on behalf of a group of users including himself. MSNC-CLRSC is provably confidential and unforgeable under the hardness of the co-decisional bilinear Diffie-Hellman and co-computational Diffie-Hellman problems in the random oracle model;moreover, it can resist the pollution attacks and has relatively low computation complexity.
We consider a new variant of the exact repair distributed storage problem, the multi-source exact repair problem, wherein the reconstruction decoders are each only required to provide a subset of the source variables....
详细信息
ISBN:
(纸本)9781479930012
We consider a new variant of the exact repair distributed storage problem, the multi-source exact repair problem, wherein the reconstruction decoders are each only required to provide a subset of the source variables. To best illustrate the idea, we generalize the (n, k, d) = (3, 2, 2) exact repair distributed storage problem to the multisource case. When every decoder demands all source variables, the rate region of the (3, 2, 2) exact repair problem is known to be same as that of the (3, 2, 2) functional repair problem, while the rate region for (3, 2, 2) case with multiple sources is unknown. We find achievable rate regions for vector binary and scalar binary codes via an automated approach.
In severe disaster environments, wireless sensor networks (WSNs) need to be tolerant to spatial node failure due to external factors such as bomb attack and river overflow. The aim of this paper is to realize data-gat...
详细信息
ISBN:
(纸本)9781479923557
In severe disaster environments, wireless sensor networks (WSNs) need to be tolerant to spatial node failure due to external factors such as bomb attack and river overflow. The aim of this paper is to realize data-gathering WSNs that keep the data collection ratio as high as possible while keeping system lifetime as long as possible. This paper proposes not only a multipath data gathering protocol called "Side Trip (ST)" scheme to enhance spatial node-failure tolerance, but also an improved version of ST scheme called " Side Trip with networkcoding (STNC)" scheme which utilizes inter-flow XOR networkcoding to reduce redundant packets without affecting the system lifetime significantly. In data-gathering WSNs, nodes further from a sink node tend to relay fewer packets. In the ST scheme, a node establishes another secondary path which, for some distance, passes through nodes the same hop count away from the sink in order to spatially separate the path from the primary path. In the STNC scheme, redundant packets from different source nodes are network-coded into an encoded packet in order to reduce the number of redundant packets. We compare the ST scheme, STNC scheme, and two existing multipath protocols, i.e., H-SPREAD (hybrid-secure protocol for reliable data delivery) scheme and Sub-branch multipath Routing Protocol (SMRP) scheme, by means of a self-developed simulator. The results show that STNC scheme and ST scheme offer enhanced tolerance to node-failure compared to H-SPREAD scheme and SMRP scheme with no significant impact on system lifetime.
暂无评论