Linear Network Error Correction Coding: A Revisit

03/15/2021
by   Xuan Guang, et al.
0

We consider linear network error correction (LNEC) coding when errors may occur on edges of a communication network of which the topology is known. In this paper, we first revisit and explore the framework of LNEC coding, and then unify two well-known LNEC coding approaches. Furthermore, by developing a graph-theoretic approach to the framework of LNEC coding, we obtain a significantly enhanced characterization of the error correction capability of LNEC codes in terms of the minimum distances at the sink nodes. In LNEC coding, the minimum required field size for the existence of LNEC codes, in particular LNEC maximum distance separable (MDS) codes which are a type of most important optimal codes, is an open problem not only of theoretical interest but also of practical importance, because it is closely related to the implementation of the coding scheme in terms of computational complexity and storage requirement. By applying the graph-theoretic approach, we obtain an improved upper bound on the minimum required field size. The improvement over the existing results is in general significant. The improved upper bound, which is graph-theoretic, depends only on the network topology and requirement of the error correction capability but not on a specific code construction. However, this bound is not given in an explicit form. We thus develop an efficient algorithm that can compute the bound in linear time. In developing the upper bound and the efficient algorithm for computing this bound, various graph-theoretic concepts are introduced. These concepts appear to be of fundamental interest in graph theory and they may have further applications in graph theory and beyond.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2018

Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors

In practical communication and computation systems, errors occur predomi...
research
12/01/2022

The Subfield Metric and its Application to Quantum Error Correction

We introduce a new weight and corresponding metric over finite extension...
research
05/08/2023

A new construction of an MDS convolutional code of rate 1/2

Maximum distance separable convolutional codes are characterized by the ...
research
02/03/2018

Coding Theory: the unit-derived methodology

The unit-derived method in coding theory is shown to be a unique optimal...
research
01/04/2019

Network Coding Solutions for the Combination Network and its Subgraphs

The combination network is one of the simplest and insightful networks i...
research
05/14/2022

General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers

In this paper, a general framework for linear secure distributed matrix ...
research
07/26/2021

PAD: a graphical and numerical enhancement of structural coding to facilitate thematic analysis of a literature corpus

We suggest an enhancement to structural coding through the use of (a) ca...

Please sign up or login with your details

Forgot password? Click here to reset