Fountain Codes Research Articles

Combination of RIS and Fountain Codes in NOMA relay wireless networks for enhancing system performance and security

Combination of RIS and Fountain Codes in NOMA relay wireless networks for enhancing system performance and security

Security-Reliability Analysis of NOMA-Assisted Hybrid Satellite-Terrestrial Relay Multi-Cast Transmission Networks Using Fountain Codes and Partial Relay Selection with Presence of Multiple Eavesdroppers

This article proposes a hybrid satellite-terrestrial relaying network (HSTRN) that integrates physical-layer security (PLS), Fountain codes (FCs), non-orthogonal multiple access (NOMA), and partial relay selection (PRS) to enhance system performance in terms of reliability, data rate, and security. In the proposed system, a satellite uses NOMA to simultaneously transmit Fountain packets to two clusters of terrestrial users. Data transmission is assisted by one of the terrestrial relay stations, selected by the PRS algorithm. We derive exact expressions for outage probability (OP) and system outage probability (SOP) at the legitimate users, as well as intercept probability (IP) and system intercept probability (SIP) at eavesdroppers. Monte Carlo simulations are realized to validate the accuracy of the analytical results, illustrate performance trends, and analyze the impact of key parameters on the considered performance.

Evading Antivirus Detection Using Fountain Code-Based Techniques for Executing Shellcodes.

In this study, we propose a method for successfully evading antivirus detection by encoding malicious shellcode with fountain codes. The Meterpreter framework for Microsoft Windows 32-bit and 64-bit architectures was used to produce the shellcode used in this investigation. The experimental results proved that detection rates were substantially decreased. Specifically, the number of detected instances using antivirus vendors for 32-bit shellcode decreased from 18 to 3, while for 64-bit shellcode, it decreased from 16 to 1. This method breaks up a malicious payload into many packets, each with their own distinct structure, and then encodes them. This obfuscation approach maintains the shellcode's integrity, ensuring correct code execution. However, in the persistence phase of the penetration testing process, this method offers an additional means of evading antivirus techniques.

SIBW: A Swarm Intelligence-Based Network Flow Watermarking Approach for Privacy Leakage Detection in Digital Healthcare Systems.

The exponential growth of sensitive patient information and diagnostic records in digital healthcare systems has increased the complexity of data protection, while frequent medical data breaches severely compromise system security and reliability. Existing privacy protection techniques often lack robustness and real-time capabilities in high-noise, high-packet-loss, and dynamic network environments, limiting their effectiveness in detecting healthcare data leaks. To address these challenges, we propose a Swarm Intelligence-Based Network Watermarking (SIBW) method for real-time privacy data leakage detection in digital healthcare systems. SIBW integrates fountain codes with outer error correction codes and employs a Multi-Phase Synergistic Swarm Optimization Algorithm (MPSSOA) to dynamically optimize encoding parameters, significantly enhancing the robustness and interference resistance of watermark detection. Additionally, a reliable synchronization sequence and lightweight embedding mechanism are designed to ensure adaptability to complex, dynamic networks. Experimental results demonstrate that SIBW achieves over 90% detection accuracy under high latency jitter and packet loss conditions, surpassing existing methods in both robustness and efficiency. With a compact design of only 3.7 MB, SIBW is particularly suited for rapid deployment in resource-constrained digital healthcare systems.

ANALYSIS OF OUTAGE PROBABILITY AND INTERCEPT PROBABILITY TRADE-OFF FOR SECURE TWO-WAY RELAYING SCHEMES BETWEEN TWO CLUSTERS OF NODES USING FOUNTAIN CODES

This paper presents two secure two-way relaying schemes between two clusters of nodes: i) 3-phase two-way relaying using Digital Network Coding; ii) conventional 4-phase two-way relaying. In the proposed schemes, one node selected from each cluster will use Fountain codes to encode the original data, and then send encoded packets to nodes in the remaining cluster, with the help of a common relay node. Explicit mathematical expressions are derived to evaluate the outage probability (system outage probability) and intercept probability (system intercept probability) of the proposed schemes over Rayleigh fading channel. Our results show a reliability-security trade-off as well as the impact of system parameters on the network performances.

Fountain Coding Based Two-Way Relaying Cognitive Radio Networks Employing Reconfigurable Intelligent Surface and Energy Harvesting

This paper examines two-way relaying cognitive radio networks utilizing fountain coding (FC), reconfigurable intelligent surfaces (RIS), and radio frequency energy harvesting (EH). In the proposed schemes, two secondary sources attempt to exchange data with each other through the assistance of an RIS deployed in the network. Using FC, one source sends its encoded packets to the other source, which must collect enough packets for a successful data recovery. The transmit power of the two sources is adjusted according to an interference constraint given by a primary user and the energy harvested from a power station. In the conventional scheme, one source continuously transmits FC packets to the other, using the maximum number of transmissions allowed. In the modified scheme, as soon as one source collects a sufficient number of FC packets, it notifies the other source to stop transmission. We derive closed-form expressions of outage probability (OP) at each source, system outage probability (SOP), and average number of FC-packet transmissions for the successful data exchange of the considered schemes over Rayleigh fading channels. Simulation results are provided to validate our analysis, to compare the performance of the considered schemes, and to examine the impact of key parameters on performance.

Online fountain code with an improved caching mechanism

Abstract The original online fountain codes discard a large number of symbols that do not meet the requirements at the decoder. To improve channel utilization, this article proposes a new online fountain code. In the completion phase, the proposed code improves the receiving rules of encoded symbols, that is, the encoded symbols discarded in the original online fountain codes are selectively cached. Moreover, an optimal degree selection strategy of encoded symbols is obtained in the proposed scheme. The valid degree range of the proposed strategy is also analyzed, leading to an upper bound of cached events which eventually limits the number of feedbacks. The theoretical analysis and simulation results reveal that the proposed scheme outperforms two state‐of‐the‐art online fountain codes in terms of overhead factors, number of feedback transmissions, and encoding/decoding efficiency.

Optimizing fountain codes for DNA data storage

Optimizing fountain codes for DNA data storage

Improved PEG-Based Construction of Analog Fountain Codes.

This paper proposes an improved progressive edge-growth (PEG) construction of analog fountain codes (AFCs). During edge selection, it simultaneously allocates weight coefficients in descending order. Analysis shows that our proposed construction reduces the probability of large weight coefficients involved in harmful short cycles. Simulation results indicate that it has good block error rate (BLER) in short block length regime.

Expanding-Window Zigzag Decodable Fountain Codes for Scalable Multimedia Transmission

In this article, we present a coding method called expanding-window zigzag decodable fountain code with unequal error protection property (EWF-ZD UEP code) to achieve scalable multimedia transmission. The key idea of the EWF-ZD UEP code is to utilize bit-shift operation and expanding-window strategy to improve the decoding performance of the high-priority data without performance deterioration of the low-priority data. To provide more protection for the high-priority data, we precode the different importance level using LDPC codes of varying code rates. The generalized variable nodes of different importance levels are further grouped into several windows. Each window is associated with a selection probability and a bit-shift distribution. The combination of bit-shift and symbol exclusive-or operations is used to generate an encoded symbol. Theoretical and simulation results on input symbols of two importance levels reveal that the proposed EWF-ZD UEP code exhibits UEP property. With a small bit shift, the decoding delay for recovering high-priority input symbols is decreased without degrading the decoding performance of the low-priority input symbols. Moreover, according to the simulation results on scalable video coding, our scheme provides better basic video quality at a lower proportion of received symbols compared to three state-of-art UEP fountain codes.

Partitioned Analog Fountain Codes for Short Packet Communications

Partitioned Analog Fountain Codes for Short Packet Communications

Raptor Codes with LT-LDPC Precoding Performance Analysis and FPGA Optimization

Raptor codes are designed to effectively handle packet loss and erasures as a type of fountain code, capable of generating an unlimited number of encoded symbols from source informations, which is particularly useful in scenarios where the number of transmissions is unknown or variable. Luby Transform (LT) codes, a kind of fountain code encoding method, exhibit linear complexity, and Low-Density Parity-Check (LDPC) codes can be constructed by the generator matrix and the parity-check matrix. The LT-LDPC pre-coding method combines the advantages of both, enhancing encoding and decoding efficiency. Deploying code on Field-Programmable Gate Arrays (FPGAs) involves several steps: synthesis, place and route, and bitstream generation, followed by loading the bitstream onto the FPGA to configure its internal logic according to the coding methods. This paper introduces a method of encoding and decoding Raptor codes, utilizing the intimal LT codes and the peripheral LDPC codes constructed by PEG. It employs a lop-BP decoding method over noise channels based on the Tanner graph for decoding and deploys the optimized algorithm on FPGA to enhance performance.

An Underwater Source Location Privacy Protection Scheme Based on Game Theory in a Multi-Attacker Cooperation Scenario.

Ensuring source location privacy is crucial for the security of underwater acoustic sensor networks amid the growing use of marine environmental monitoring. However, the traditional source location privacy scheme overlooks multi-attacker cooperation strategies and also has the problem of high communication overhead. This paper addresses the aforementioned limitations by proposing an underwater source location privacy protection scheme based on game theory under the scenario of multiple cooperating attackers (SLP-MACGT). First, a transformation method of a virtual coordinate system is proposed to conceal the real position of nodes to a certain extent. Second, through using the relay node selection strategy, the diversity of transmission paths is increased, passive attacks by adversaries are resisted, and the privacy of source nodes is protected. Additionally, a secure data transmission technique utilizing fountain codes is employed to resist active attacks by adversaries, ensuring data integrity and enhancing data transmission stability. Finally, Nash equilibrium could be achieved after the multi-round evolutionary game theory of source node and multiple attackers adopting their respective strategies. Simulation experiments and performance evaluation verify the effectiveness and reliability of SLP-MACGT regarding aspects of the packet forwarding success rate, security time, delay and energy consumption: the packet delivery rate average increases by 30%, security time is extended by at least 85%, and the delay is reduced by at least 90% compared with SSLP, PP-LSPP, and MRGSLP.

Data recovery methods for DNA storage based on fountain codes

Data recovery methods for DNA storage based on fountain codes

Implementation of the Asymmetric Fountain Code Algorithm to Secure Aviation Licensing and Regulatory Document Data

Several agencies, both government and private, require the security of personal data, especially as this information can only be accessed or transmitted to authorized people or organizations. Likewise with license and regulatory records, these materials are exceedingly confidential. Documents pertaining to permissions and regulations issued by aviation authorities, such as operating permits and aircraft certification, However, the difficulty is that when data is distributed using an internet connection, it can slip into the hands of unscrupulous people. Implementation of the Asymmetric Fountain Code Algorithm to safeguard confidential text data is used to safeguard license and regulatory document data with encryption and description methods using the Fountain Code Algorithm, which has two keys to access plaintext and ciphertext documents using SharpDevelop 5.1 software in the C# language. This research reveals that the outputs of the Fountain Code algorithm can restore plaintext data in its entirety. So it can be inferred that the asymmetric Fountain Code algorithm meets good data integrity and is safe; the complexity of the algorithm is simpler; and the amount of plaintext is exactly related to time.

Fountain Coded Coordinated Multipoint for 5G MBMS UAV Relay

Fountain Coded Coordinated Multipoint for 5G MBMS UAV Relay

FCMPR:A multi-path secure transmission method based on link security assessment and fountain coding

FCMPR:A multi-path secure transmission method based on link security assessment and fountain coding

Enhancing Secrecy Performance Using Fountain Codes and NOMA Under Joint Cooperative Jamming Technique and Intelligent Reflective Surface

Ensuring content security and copyright protection is a critical concern in wireless communication networks. Furthermore, the emergence of services demanding high-band width and very low delay such as online Games, extended reality (XR), Metaverses, etc., Non-Orthogonal Multiple Access (NOMA) is a technology with the potential to enhance the spectral efficiency of fifth-generation (5G) wireless network and beyond. Hence, this paper studies a NOMA-based downlink system that employs intelligent reconfigurable surfaces (IRS) and operates in a physical-layer security environment. Our study also incorporates the utilization of Fountain codes (FCs), all while contending with the presence of a malicious eavesdropper. Furthermore, a cooperative jamming technique is employed to degrade the quality of the eavesdropping channel. The main contribution of this paper is to derive precise closed-form expressions of outage probability (OP), energy efficiency (EE), intercept probability (IP), and average secrecy rate (ASR) for the proposed system. We also develop a Deep Neural Network (DNN) model to evaluate OP, IP, ASR and the average number of time slots (ATS). Subsequently, Monte Carlo simulations are presented as a means to validate the theoretical findings. The simulation results yield the following insights: i) Their primary purpose is to validate the analytical formulas. ii) This research significantly contributes to deepening our understanding of IRS-NOMA systems, providing a foundation for future investigations into practical implementations. iii) We investigate the optimal power allocation factors within the IRS-NOMA framework, offering valuable insights into designing IRS-NOMA systems to achieve reliable and secure communication. iv) The results illustrate the superior performance of IRS-NOMA in comparison to the conventional IRS-Orthogonal Multiple Access (OMA) method.

Code-Division Space-Time Fountain Code for Plasma Sheath Communication

Influenced by the special physical characteristics of the plasma sheath and the parameters of the aircraft's attitude, the channel containing the plasma sheath can be regarded as a special kind of discontinuous channel. A code-division space-time fountain code form is proposed that is suitable for the spatial characteristics of the plasma sheath channel. Simulation results show that the use of code-division space-time fountain code maximizes the use of the airspace resources in the plasma sheath channel. The scheme proposed in this paper can be used to alleviate the ''ionization blackout'' problem faced by hypersonic vehicles in the reentry process. INDEX TERMS plasma sheath, spatial-domain resource, communication window, fountain code, interleaved code.

Iterative Soft Decoding Algorithm for DNA Storage Using Quality Score and Redecoding.

Ever since deoxyribonucleic acid (DNA) was considered as a next-generation data-storage medium, lots of research efforts have been made to correct errors occurred during the synthesis, storage, and sequencing processes using error correcting codes (ECCs). Previous works on recovering the data from the sequenced DNA pool with errors have utilized hard decoding algorithms based on a majority decision rule. To improve the correction capability of ECCs and robustness of the DNA storage system, we propose a new iterative soft decoding algorithm, where soft information is obtained from FASTQ files and channel statistics. In particular, we propose a new formula for log-likelihood ratio (LLR) calculation using quality scores (Q-scores) and a redecoding method which may be suitable for the error correction and detection in the DNA sequencing area. Based on the widely adopted encoding scheme of the fountain code structure proposed by Erlich et al., we use three different sets of sequenced data to show consistency for the performance evaluation. The proposed soft decoding algorithm gives 2.3% ∼ 7.0% improvement of the reading number reduction compared to the state-of-the-art decoding method and it is shown that it can deal with erroneous sequenced oligo reads with insertion and deletion errors.