arrow
Return

An LEK-Based Design Algorithm for MDS Linear Network Error Correction Codes on Cyclic Multicast Networks

delete2019-11-01
delete1
PRE
AI
M
Morteza Esmaeili
T
T. Aaron Gulliver *
DOI:10.1109/TCOMM.2019.2931571delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A linear network (LN) code can be described by either global encoding kernels (GEKs) or local encoding kernels (LEKs). In the literature, the multicast property of an LN code is described using GEKs, so the design algorithms for multicast LN codes employ GEKs to check this property. In this paper, a criterion is developed so that LEKs rather than GEKs can be used to check the multicast maximum distance separable (MDS) property of linear network error correction (LNEC) codes on erroneous networks. Further, it is used to develop a design algorithm for multicast MDS LNEC codes on erroneous cyclic networks. This algorithm is more efficient than the algorithm that uses GEKs when the number of edges is high and the interconnection of these edges is low.
Keywords:
Erroneous cyclic network
local encoding kernel (LEK)
global encoding kernel (GEK)
linear network error correction (LNEC) code
maximum distance separable (MDS)
multicast
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Communications cover
IEEE Transactions on Communications
IF:
8.3
Papers:
1.2W
Citations:
3.6W

Organization

U
University of Victoria
Scholars:
1.0W
Papers: 1.0W
Citations: 1.5W
I
Isfahan University of Technology
Scholars:
9.0K
Papers: 8.6K
Citations: 8.7K