English
Related papers

Related papers: Linear Network Error Correction Coding: A Revisit

200 papers

Recently, network error correction coding (NEC) has been studied extensively. Several bounds in classical coding theory have been extended to network error correction coding, especially the Singleton bound. In this paper, following the…

Information Theory · Computer Science 2010-11-08 Xuan Guang , Fang-Wei Fu , Zhen Zhang

In the practical network communications, many internal nodes in the network are required to not only transmit messages but decode source messages. For different applications, four important classes of linear network codes in network coding…

Information Theory · Computer Science 2013-12-02 Xuan Guang , Fang-Wei Fu

Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under small field size conditions. In this work, we investigate the…

Information Theory · Computer Science 2010-01-08 K. Prasad , B. Sundar Rajan

Link and node failures are two common fundamental problems that affect operational networks. Protection of communication networks against such failures is essential for maintaining network reliability and performance. Network protection…

Information Theory · Computer Science 2010-08-26 Salah A. Aly , Ahmed E. Kamal , Anwar I. Walid

In this paper, network error control coding is studied for robust and efficient multicast in a directed acyclic network with imperfect links. The block network error control coding framework, BNEC, is presented and the capability of the…

Information Theory · Computer Science 2008-09-25 Hossein Bahramgiri , Farshad Lahouti

In the paradigm of network coding, the information-theoretic security problem is encountered in the presence of a wiretapper, who has capability of accessing an unknown channel-subset in communication networks. In order to combat this…

Information Theory · Computer Science 2016-11-28 Xuan Guang

The Graph Edit Distance (GED) is an important metric for measuring the similarity between two (labeled) graphs. It is defined as the minimum cost required to convert one graph into another through a series of (elementary) edit operations.…

Databases · Computer Science 2025-11-05 Andrea D'Ascenzo , Julian Meffert , Petra Mutzel , Fabrizio Rossi

In this work, we introduce convolutional codes for network-error correction in the context of coherent network coding. We give a construction of convolutional codes that correct a given set of error patterns, as long as consecutive errors…

Information Theory · Computer Science 2009-08-06 K. Prasad , B. Sundar Rajan

We study ensembles of codes on graphs (generalized low-density parity-check, or LDPC codes) constructed from random graphs and fixed local constrained codes, and their extension to codes on hypergraphs. It is known that the average minimum…

Information Theory · Computer Science 2011-02-22 Alexander Barg , Arya Mazumdar

We apply linear network coding (LNC) to broadcast a block of data packets from one sender to a set of receivers via lossy wireless channels, assuming each receiver already possesses a subset of these packets and wants the rest. We aim to…

Information Theory · Computer Science 2018-02-09 Mingchao Yu , Alex Sprintson , Parastoo Sadeghi

Passive network tomography uses end-to-end observations of network communication to characterize the network, for instance to estimate the network topology and to localize random or adversarial glitches. Under the setting of linear network…

Networking and Internet Architecture · Computer Science 2016-11-15 Hongyi Yao , Sidharth Jaggi , Minghua Chen

It is well known that the minimum distance for linear network codes plays the same role as the minimum distance for classical error control codes. However, Yang and Yeung (2008) discovered that for nonlinear network codes, the minimum…

Information Theory · Computer Science 2026-04-02 Yulin Chen , Raymond W. Yeung

In this paper, for the purposes of information transmission and network error correction simultaneously, three classes of important linear network codes in network coding, linear multicast/broadcast/dispersion codes are generalized to…

Information Theory · Computer Science 2013-02-19 Xuan Guang , Fang-Wei Fu

We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…

Information Theory · Computer Science 2022-05-31 Allison Beemer , Altan Berdan Kilic , Alberto Ravagnani

To address growth challenges facing large Data Centers and supercomputing clusters a new construction is presented for scalable, high throughput, low latency networks. The resulting networks require 1.5-5 times fewer switches, 2-6 times…

Information Theory · Computer Science 2014-03-25 Ratko V. Tomic

We consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting…

Information Theory · Computer Science 2011-08-16 Qiwen Wang , Sidharth Jaggi , Shuo-Yen Robert Li

The problem of error-control in random linear network coding is considered. A ``noncoherent'' or ``channel oblivious'' model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer…

Information Theory · Computer Science 2008-03-25 Ralf Koetter , Frank Kschischang

Differential linear network coding (DLNC) is a precoding scheme for information transmission over random linear networks. By using differential encoding and decoding, the conventional approach of lifting, required for inherent channel…

Information Theory · Computer Science 2015-01-29 Sven Puchinger , Michael Cyran , Robert F. H. Fischer , Martin Bossert , Johannes B. Huber

The problem of error correction in both coherent and noncoherent network coding is considered under an adversarial model. For coherent network coding, where knowledge of the network topology and network code is assumed at the source and…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang

Assume that a graph $G$ models a detection system for a facility with a possible "intruder," or a multiprocessor network with a possible malfunctioning processor. We consider the problem of placing (the minimum number of) detectors at a…

Discrete Mathematics · Computer Science 2022-04-26 Devin Jean , Suk Seo
‹ Prev 1 2 3 10 Next ›