English
Related papers

Related papers: Lowest Density MDS Array Codes for Reliable Smart …

200 papers

As a typical Cyber-Physical System (CPS), smart water distribution networks require monitoring of underground water pipes with high sample rates for precise data analysis and water network control. Due to poor underground wireless channel…

Social and Information Networks · Computer Science 2017-03-30 Sokratis Kartakis , Shusen Yang , Julie A. McCann

We consider an energy harvesting transmitter sending status updates to a receiver over an erasure channel, where each status update is of length $k$ symbols. The energy arrivals and the channel erasures are independent and identically…

Information Theory · Computer Science 2018-02-02 Abdulrahman Baknina , Sennur Ulukus

Low-density spreading non-orthogonal multiple-access (LDS-NOMA) is considered where $K$ single-antenna user-equipments (UEs) communicate with a base-station (BS) over $F$ fading sub-carriers. Each UE $k$ spreads its data symbols over…

Signal Processing · Electrical Eng. & Systems 2020-06-24 Hossein Asgharimoghaddam , Jarkko Kaleva , Antti Tölli

Matrix computations are a fundamental building-block of edge computing systems, with a major recent uptick in demand due to their use in AI/ML training and inference procedures. Existing approaches for distributing matrix computations…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-12 Anindya Bijoy Das , Aditya Ramamoorthy , David J. Love , Christopher G. Brinton

The repair bandwidth of a code is the minimum amount of data required to repair one or several failed nodes (erasures). For MDS codes, the repair bandwidth is bounded below by the so-called cut-set bound, and codes that meet this bound with…

Information Theory · Computer Science 2017-10-20 Min Ye , Alexander Barg

We proposed a new criterion \textit{noise-stability}, which revised the classical rigidity theory, for evaluation of MDS algorithms which can truthfully represent the fidelity of global structure reconstruction; then we proved the…

Computational Geometry · Computer Science 2022-07-15 Zishuo Zhao

In distributed storage systems, erasure codes with locality $r$ is preferred because a coordinate can be recovered by accessing at most $r$ other coordinates which in turn greatly reduces the disk I/O complexity for small $r$. However, the…

Information Theory · Computer Science 2014-10-20 Anyu Wang , Zhifang Zhang

The vision of wireless sensor networks is one of a smart collection of tiny, dumb devices. These motes may be individually cheap, unintelligent, imprecise, and unreliable. Yet they are able to derive strength from numbers, rendering the…

Information Theory · Computer Science 2007-07-13 A. G. Dimakis , D. Petrovic , K. Ramchandran

Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part of the Ethereum roadmap. This motivates us to consider…

Information Theory · Computer Science 2026-04-17 Amit Berman , Yaron Shany , Itzhak Tamo

In this paper, we propose a Modified distributed storage algorithm for wireless sensor networks (MDSA). Wireless Sensor Networks, as it is well known, suffer of power limitation, small memory capacity,and limited processing capabilities.…

Networking and Internet Architecture · Computer Science 2012-11-13 Mohamed Labib Borham , Mostafa Sami Mostafa , Hossam Eldeen Moustafa Shamardan

In distributed quantum storage, physical qubits of a code will be stored across the network. When qubits in one of the nodes are lost i.e. when the node is erased, the remaining nodes need to communicate with a new node to replace the lost…

Quantum Physics · Physics 2025-05-27 Kaushik Senthoor

Heterogeneous Distributed Storage Systems (DSSs) are close to the real world applications for data storage. Each node of the considered DSS, may store different number of packets and each having different repair bandwidth with uniform…

Information Theory · Computer Science 2016-07-22 Krishna Gopal Benerjee , Manish K. Gupta

Random linear network coding (RLNC) in theory achieves the max-flow capacity of multicast networks, at the cost of high decoding complexity. To improve the performance-complexity tradeoff, we consider the design of sparse network codes. A…

Information Theory · Computer Science 2016-04-20 Ye Li , Wai-Yip Chan , Steven D. Blostein

The limited and dynamically varied resources on edge devices motivate us to deploy an optimized deep neural network that can adapt its sub-networks to fit in different resource constraints. However, existing works often build sub-networks…

Computer Vision and Pattern Recognition · Computer Science 2022-07-05 Zhongnan Qu , Syed Shakib Sarwar , Xin Dong , Yuecheng Li , Ekin Sumbul , Barbara De Salvo

Multiple-input, multiple-output (MIMO) technology provides high data rate and enhanced QoS for wireless com- munications. Since the benefits from MIMO result in a heavy computational load in detectors, the design of low-complexity…

Hardware Architecture · Computer Science 2015-03-17 Ni-Chun Wang , Ezio Biglieri , Kung Yao

With the expansion of the software scale and complexity of smart grid systems, the detection of smart grid software defects has become a research hotspot. Because of the large scale of the existing smart grid software code, the efficiency…

Software Engineering · Computer Science 2020-08-25 Ling Yuan , Siyuan Zhou , Neal Xiong

In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists in starting from the parity-check…

Information Theory · Computer Science 2008-10-08 E. Paolini , M. Chiani

We revisit zigzag array codes, a family of MDS codes known for achieving optimal access and optimal rebuilding ratio in single-node repair. In this work, we endow zigzag codes with two new properties: small field size and low skip cost.…

Information Theory · Computer Science 2025-09-30 Wenqin Zhang , Han Mao Kiah , Son Hoang Dau

Multidimensional scaling (MDS) is a popular dimensionality reduction techniques that has been widely used for network visualization and cooperative localization. However, the traditional stress minimization formulation of MDS necessitates…

Optimization and Control · Mathematics 2016-12-22 Ketan Rajawat , Sandeep Kumar

We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linear functions of the source message. The setting is one in…

Information Theory · Computer Science 2018-08-07 N. Prakash , Muriel Medard
‹ Prev 1 8 9 10 Next ›