English
Related papers

Related papers: Weakly Secure MDS Codes for Simple Multiple Access…

200 papers

In network communication, the source often transmits messages at several different information rates within a session. How to deal with information transmission and network error correction simultaneously under different rates is introduced…

Information Theory · Computer Science 2014-03-04 Xuan Guang , Fang-Wei Fu , Zhen Zhang

We consider {\it i)} the overhead minimization of maximum-distance separable (MDS) storage codes for the repair of a single failed node and {\it ii)} the total secure degrees-of-freedom (S-DoF) maximization in a multiple-access compound…

Information Theory · Computer Science 2015-03-17 Dimitris S. Papailiopoulos , Alexandros G. Dimakis

We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources,…

Information Theory · Computer Science 2016-11-17 Yonathan Murin , Ron Dabora , Deniz Gündüz

We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed…

Information Theory · Computer Science 2014-01-17 Son Hoang Dau , Wentu Song , Chau Yuen

The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver $n$ packets from source to each receiver, and the wiretapper can eavesdrop…

Information Theory · Computer Science 2016-11-17 Danilo Silva , Frank R. Kschischang

This article examines the secrecy coding aided wireless communications from a source to a destination in the presence of an eavesdropper from a security-reliability tradeoff (SRT) perspective. Explicitly, the security is quantified in terms…

Information Theory · Computer Science 2016-11-17 Yulong Zou , Jia Zhu , Xuelong Li , Lajos Hanzo

Distributed storage systems employ codes to provide resilience to failure of multiple storage disks. Specifically, an $(n, k)$ MDS code stores $k$ symbols in $n$ disks such that the overall system is tolerant to a failure of up to $n-k$…

Information Theory · Computer Science 2013-05-16 Sreechakra Goparaju , Itzhak Tamo , Robert Calderbank

We consider a multi-way relay network with an orthogonal uplink and correlated sources, and we characterise reliable communication (in the usual Shannon sense) with a single-letter expression. The characterisation is obtained using a joint…

Information Theory · Computer Science 2013-09-18 Roy Timo , Gottfried Lechner , Lawrence Ong , Sarah J. Johnson

Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code with the property of degraded-read friendly (DRF) is…

Information Theory · Computer Science 2021-02-05 Ting-Yi Wu , Yunghsiang S. Han , Zhengrui Li , Bo Bai , Gong Zhang , Liang Chen , Xiang Wu

Coding schemes for discrete memoryless multicast networks (DM-MN) with rate-limited feedback from the receivers and relays to the transmitter are proposed. The schemes improve over the noisy network coding proposed by Lim et al.. For the…

Information Theory · Computer Science 2016-11-17 Youlong Wu

Reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs) is considered. In MARCs, only the destination is interested in a reconstruction of the…

Information Theory · Computer Science 2012-07-04 Yonathan Murin , Ron Dabora , Deniz Gündüz

Multishot network coding is considered in a worst-case adversarial setting in which an omniscient adversary with unbounded computational resources may inject erroneous packets in up to $t$ links, erase up to $\rho$ packets, and wire-tap up…

Information Theory · Computer Science 2019-04-18 Umberto Martínez-Peñas , Frank R. Kschischang

We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that are built into the existing redundancy of the system, we propose a…

Cryptography and Security · Computer Science 2015-03-17 Theodoros K. Dikaliotis , Alexandros G. Dimakis , Tracey Ho

Wireless sensor networks (WSNs) have many potential applications [1, 5] and unique challenges. They usually consist of hundreds or thousands small sensor nodes such as MICA2, which operate autonomously; conditions such as cost, invisible…

Cryptography and Security · Computer Science 2011-03-30 Shahriar Mohammadi , Hossein Jadidoleslamy

Maximum distance separable (MDS) array codes constitute an important class of error-correcting codes due to their optimal distance properties and their relevance in distributed storage systems. In this paper, we investigate the construction…

Array codes have been widely used in communication and storage systems. To reduce computational complexity, one important property of the array codes is that only XOR operation is used in the encoding and decoding process. In this work, we…

Information Theory · Computer Science 2016-12-01 Hanxu Hou , Yunghsiang S. Han

Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Unfortunately, these networks are vulnerable to numerous security threats that can adversely affect…

Cryptography and Security · Computer Science 2021-09-07 Jaydip Sen

Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Unfortunately, these networks are vulnerable to numerous security threats that can adversely affect…

Cryptography and Security · Computer Science 2012-09-09 Jaydip Sen , Sripad Krishna

Maximum distance separable (MDS) codes are widely used in distributed storage systems as they provide optimal fault tolerance for a given amount of storage overhead. The seminal work of Dimakis~\emph{et al.} first established a lower bound…

Information Theory · Computer Science 2026-03-24 Zihao Zhang , Guodong Li , Sihuang Hu

A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a distributed storage system (DSS). Previous work in the literature focuses on code…

Information Theory · Computer Science 2014-02-19 Son Hoang Dau , Wentu Song , Chau Yuen