This paper proposes a distributed joint source-channel coding (DJSCC) scheme using polar-like codes. In the proposed scheme, each distributed source encodes source message with a quasi-uniform systematic polar code (QSPC) or a punctured QSPC, and onl...
A distributed arithmetic coding algorithm based on source symbol purging and using the context model is proposed to solve the asymmetric Slepian–Wolf problem. The proposed scheme is to make better use of both the correlation between adjacent symbols...
In wireless distributed computing systems, worker nodes connect to a master node wirelessly and perform large-scale computational tasks that are parallelized across them. However, the common phenomenon of straggling (i.e., worker nodes often experien...
Considering the fact that sensors are energy-limited and the wireless channel conditions in wireless sensor networks, there is an urgent need for a low-complexity coding method with high compression ratio and noise-resisted features. This paper revie...
As a typical symbol-wise solution of asymmetric Slepian-Wolf coding problem, Distributed Arithmetic Coding (DAC) non-linearly partitions source space into disjoint cosets with unequal sizes. The distribution of DAC coset cardinalities, named the Cose...
Motivated by task-oriented semantic communication and distributed learning systems, this paper studies a distributed indirect source coding problem where M correlated sources are independently encoded for a central decoder. The decoder has access to...
Distributed video coding (DVC) is an attractive and promising solution for low complexity constrained video applications, such as wireless sensor networks or wireless surveillance systems. In DVC, visual quality consistency is one of the most importa...
Various techniques have been used in distributed file systems for data availability and stability. Typically, a method for storing data in a replication technique-based distributed file system is used, but due to the problem of space efficiency, an e...
Distributed space time frequency coding (DSTFC) schemes address problems of performance degradation encountered by cooperative broadband networks operating in highly mobile environments. Channel state information (CSI) acquisition is, however, imprac...
In order to effectively improve the quality of side information in distributed video coding, we propose a side information generation scheme based on a coefficient matrix improvement model. The discrete cosine transform coefficient bands of the Wyner...
Distributed video coding (DVC) is a novel coding paradigm that offers low computational encoding relative to conventional video-coding framework at the expense of high-decoding computational complexity. The challenging part of this video-coding frame...
With the development of various information and communication technologies, the amount of big data has increased, and distributed file systems have emerged to store them stably. The replication technique divides the original data into blocks and writ...
In many wireless sensor network applications, the possibility of exceptions occurring is relatively small, so in a normal situation, data obtained at sequential time points by the same node are time correlated, while, spatial correlation may exist in...
This article aims to give a comprehensive and rigorous review of the principles and recent development of coding for large-scale distributed machine learning (DML). With increasing data volumes and the pervasive deployment of sensors and computing ma...
Wireless Sensor Networks (WSNs), where a multiplicity of sensors observe a physical phenomenon and transmit their measurements to one or more sinks, pertain to the class of multi-terminal source and channel coding problems of Information Theory. In t...
Distributed video coding (DVC) is based on distributed source coding (DSC) concepts in which video statistics are used partially or completely at the decoder rather than the encoder. The rate-distortion (RD) performance of distributed video codecs su...
This work studies a general distributed coded computing system based on the MapReduce-type framework, where distributed computing nodes within a half-duplex network wish to compute multiple output functions. We first introduce a definition of communi...
Distributed fountain coding plays an important role in rateless code research. The reliability and effectiveness of these coding schemes are increasingly challenged with the growing applications. In this paper, a novel multiple-access network with co...
When forming the radar situation of a terrain, in order to increase its information content and to extract useful information, multi-position spatially distributed systems for integrating multi-angle radar data established by small-sized UAV-based ai...
Forward error correction codes (FEC) are one of the vital sections of modern communication systems; therefore, recognition of the coding type is an important issue in non-cooperative communication. At present, the recognition of FEC codes is mainly c...
In this paper, we propose a new class of regular fractional repetition (FR) codes constructed from perfect difference families and quasi-perfect difference families to store big data in distributed storage systems. The main advantage of the proposed...
In traditional symbol-level network coding (SLNC)-based cooperative content distribution approaches, they ignore nodes in the vehicular ad hoc network (VANET) having various network-coded content pieces and distinct levels of interests and selfishnes...
For coded distributed computing (CDC), polynomial code is one prevalent encoding method for CDC (called Poly-CDC). It suffers from poor numerical stability due to the Vandermonde matrix serving as the coefficient matrix which needs to be inverted, an...
To fulfill the increasing demand on low-latency content distribution, this paper considers content distribution using generation-based network coding with the belief propagation decoder. We propose a framework to design generation-based network codes...
Large matrix multiplications commonly take place in large-scale machine-learning applications. Often, the sheer size of these matrices prevent carrying out the multiplication at a single server. Therefore, these operations are typically offloaded to...
In this paper, we propose a novel distributed unequal error protection (UEP) rateless coding scheme (DURC) for space information networks (SIN). We consider the multimedia data transmissions in a dual-hop SIN communication scenario, where multiple di...
Due to the rapid development of quantum computing technology, encryption systems based on computational complexity are facing serious threats. Based on the fundamental theorem of quantum mechanics, continuous-variable quantum key distribution (CVQKD)...
Continuous-variable quantum key distribution faces significant challenges, including quantum channel instability, particularly fluctuations in the signal-to-noise ratio (SNR) and extremely low SNR scenarios. Furthermore, non-ideal polar codes, charac...
In this paper, we derive complete weight distributions and solve constrained optimization problems for affine-half coordinate extensions of a known family of partial-spread minimal binary codes. The extended code has length
Multi-agent systems (MAS) can be used for decentralized and self-organizing data processing in a distributed system, like a resource-constrained sensor network, enabling distributed information extraction, for example, based on pattern recognition an...
Video Sensor Networks (VSNs) are recent communication infrastructures used to capture and transmit dense visual information from an application context. In such large scale environments which include video coding, transmission and display/storage, th...
Utilizing fountain codes to control the peak-to-average power ratio (PAPR) is a classic scheme in Orthogonal Frequency Division Multiplexing (OFDM) wireless communication systems. However, because the robust soliton distribution (RSD) produces large-...
The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collec...
The wireless channel is volatile in nature, due to various signal attenuation factors including path-loss, shadowing, and multipath fading. Existing media access control (MAC) protocols, such as the widely adopted 802.11 wireless fidelity (Wi-Fi) fam...
We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the pro...
Each country must determine the Grid Code conditions and apply these criteria to integrate distributed generation (DG) systems into the existing electricity grid and to ensure a stable power system. Thus, experimental studies are required to provide...
In existing cryptographic key distribution (CKD) protocols based on computational ghost imaging (CGI), the interaction among multiple legitimate users is generally neglected, and the channel noise has a serious impact on the performance. To overcome...
A blockchain is a decentralized peer-to-peer network in which all nodes store data in copies, ensuring data integrity, as transactions cannot be changed or deleted. This can lead to duplicate data storage, resulting in high storage overhead, especial...
Morphological control at the nanoscale paves the way to fabricate nanostructures with desired plasmonic properties. In this study, we discuss the nanoengineering of plasmon resonances in 1D hollow nanostructures of two different AuAg nanotubes, inclu...
Recently, the wireless sensor network paradigm is shifting toward research aimed at enabling the robust delivery of multimedia content. A challenge is to deliver multimedia content with predefined levels of Quality of Service (QoS) under resource con...
In distributed learning for data requiring privacy preservation, such as medical data, the distribution of secret information is an important problem. In this paper, we propose a framework for secret codes in application to distributed systems. Then,...
This paper summarizes the details of recently proposed binary locally repairable codes (BLRCs) and their features. The construction of codes over a small alphabet size of symbols is of particular interest for efficient hardware implementation. Theref...
The rapid development of machine learning, large language models, and related technologies has greatly increased the demand for data storage capacity. Therefore, the role of distributed storage systems in such applications has become more prominent....
The error probability of block codes sent under a non-uniform input distribution over the memoryless binary symmetric channel (BSC) and decoded via the maximum a posteriori (MAP) decoding rule is investigated. It is proved that the ratio of the proba...
It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum error correction, CSS codes are a special type of stabilizer codes constructed from classical...
This paper investigates the design of overlapped chunked codes (OCC) for multi-source multi-relay networks where a physical-layer network coding approach, compute-and-forward (CF) based on nested lattice codes (NLC), is applied for the simultaneous t...
Fractional repetition (FR) codes are a class of distributed storage codes that replicate and distribute information data over several nodes for easy repair, as well as efficient reconstruction. In this paper, we propose three new constructions of FR...
The problem of data exchange between multiple nodes with storage and communication capabilities models several current multi-user communication problems like Coded Caching, Data Shuffling, Coded Computing, etc. The goal in such problems is to design...
In a traditional distributed storage system, a source can be restored perfectly when a certain subset of servers is contacted. The coding is independent of the contents of the source. This paper considers instead a lossy source coding version of this...
We propose a universal ensemble for the random selection of rate–distortion codes which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector,
of 67