Irina E. Bocharova’s research while affiliated with University of Tartu and other places

... QAM symbol error corrections often employ block codes over GF(2 q ) accompanied by a bijective map between the symbols and the elements of Galois field [3,4]. However, the error correction coding and decoding must be changed each time different modulation order of QAM is selected. ...

Reference:

Dual-time-sharing high-order QAM symbol error correction network of mix-select cells connected with bit-transfer lines - some numerical experiments

... In this section, a general construction approach of QC-LDPC codes based on base and exponent matrices is first introduced. Compared to the QC-LDPC codes generated by the finite field construction [33], the QC-LDPC codes constructed by this approach have a more flexible code length and code rate and are easier to obtain the full-rank matrix. Then, jointly optimized construction of QC-LDPC from the view of the destination is proposed. ...

Reference:

Jointly optimized quasi-cyclic LDPC codes for coded-cooperative wireless networks based on split labeling diversity

... The set of vertices (12) corresponds to all possible positions of ones when we fix 0 = 0. if we consider a cyclic shift or a mirror image of the true key, which satisfies 0 = 0, and represent it by the same symbol 0 , ( 0 ) is a subset of ( 0 ) by definition. Moreover, a distance between any two elements in ( 0 ) is in the distance spectrum, i.e., ( , ) ∈ ( 0 ), ∀ , ∈ ( 0 ). ...

Reference:

Efficient Reconstruction in Key Recovery Attack on the QC-MDPC McEliece Cryptosystems

... Due to the growing percentage of people using these technologies, methods are needed to increase the transmission rate without reducing the quality [4] [5]. One of these methods is the Reed-Solomon (RS) and BCH codes which are used to correct errors in many systems such as Vehicular Networks, storage devices (CD, DVD, etc.) and digital video broadcasting (DVB) [6][7] [8]. An RS code word is a packet of symbols which are commonly bytes (8bit symbols), denotes as RS (n, k) where n is the number of the symbols in the encoded message and k is the number of the symbols in the original message as shown in Fig.1. ...

Reference:

Design, Optimization and Real Time Implementation of a New Embedded Chien Search Block for Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) Codes on FPGA Board

... Sending certain messages to a legitimate receiver, and observing receiver's reactions, an adversary can statistically obtain the distance spectrum. The effectiveness of this part depends on the decoding algorithm, and it has been demonstrated that the bit-flipping (BF) decoding [7], [9]- [14], which is commonly used to decode the QC-MDPC scheme, is vulnerable to this [15]: If the legitimate receiver uses the BF decoding, the attacker can easily obtain the distance spectrum. The second part is to reconstruct the secret key from a given distance spectrum. ...

Reference:

Efficient Reconstruction in Key Recovery Attack on the QC-MDPC McEliece Cryptosystems

... When the transmission fails, the header can not be decoded by the decompressor. Commonly adopted channel models include Gilbert-Elliot model [14], [16] and hidden Markov model [17]. ...

Reference:

Reinforcement Learning for Robust Header Compression (ROHC) Under Model Uncertainty

... where x represents the original data being transmitted. Here, p denotes the packet loss rate, which reflects the probability that a data packet is completely lost during transmission due to factors such as limited bandwidth or interference among vehicles [45]. The variable η ∼ N (0, 1) represents the noise, introducing random errors that can lead to incorrect interpretations of traffic conditions [46]. ...

Reference:

iLLM-TSC: Integration reinforcement learning and large language model for traffic signal control policy improvement

... Two low-complexity sliding-window (SW)-decoding procedures are studied. The first one is based on ML-decoding applied to the ZT convolutional code inside the window and the second implies conventional BP decoding and BP decoding with using redundant parity-check (RPC) matrix of the same code [26,27]. As explained below, RPC matrix contains linear dependent rows which destroy stopping sets of the code and improve erasure correcting capability compared to BP decoding while preserving low decoding complexity. ...

Reference:

Low Delay Inter-Packet Coding in Vehicular Networks

... i , and (2) i be the probabilities that symbol i will be converted into a Case-0 (an encoded symbol that is generated only by black symbols), Case-1, or Case-2 symbol, respectively, in time period [t 0 , t 1 ]. Thus, we have ...

Reference:

Online fountain code with an improved caching mechanism

... Finite length upper bounds on error probability of ML decoding over the AWGN channel obtained by using precise average weight enumerators for both binary random regular LDPC codes and for random regular NB LDPC codes over GF(2 m ) along with the asymptotic ML decoding thresholds were derived in [17]. In this paper by using technique in [18] for computing precise average spectra for ensembles of LDPC codes, we derive a tighter bound on error probability of the ML decoding for the ensemble of 'almost regular" NB LDPC codes over GF (2 m ). ...

Reference:

Optimization of NB QC-LDPC Block Codes and Their Performance Analysis