In this paper, we use extended Euclid's algorithm to propose new decoding algorithms for two classes of maximum distance separable (MDS) twisted generalized Reed-Solomon (TGRS) codes of parameters [ n , n - t , t ...
详细信息
In this paper, we use extended Euclid's algorithm to propose new decoding algorithms for two classes of maximum distance separable (MDS) twisted generalized Reed-Solomon (TGRS) codes of parameters [ n , n - t , t + 1] over F (q) . For even t , the algorithms can correct (t) /(2) errors with time complexity O ( qn ). Moreover, we also give a new decoding algorithm for a class of twisted Goppa codes. For even degree t of a Goppa polynomial, it can also correct (t) /(2) errors, which generalizes a (sic)(t -1)/(2)(sic)-error-correcting decoding algorithm by Sui and Yue (2023).
This paper investigates linear-time decoding algorithms for two classes of error-correcting codes. One of the classes is monotone codes which are known as single deletion error-correcting codes, although they are not ...
详细信息
This paper investigates linear-time decoding algorithms for two classes of error-correcting codes. One of the classes is monotone codes which are known as single deletion error-correcting codes, although they are not known to be single substitution error-correcting codes. The other is azinv codes which are known as single balanced adjacent deletion error-correcting codes, although they are not known to be single balanced adjacent substitution error-correcting codes. As a result, this paper proposes generalizations of Levenshtein's decoding algorithm for Levenshtein's single deletion or single substitution error-correcting codes. This paper points out that it is possible to unify our new two decoding algorithms. Moreover, we provide Python implementations of these algorithms and the graphs of their computational costs at https://***/Hokuto496 decoding_algorithms_of_monotone_codes_and_azinv_codes.
The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is a well-known maximum a posteriori probability decoding algorithm which has been proposed earlier for point to point communication applications, employing block codes or...
详细信息
The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is a well-known maximum a posteriori probability decoding algorithm which has been proposed earlier for point to point communication applications, employing block codes or convolutional codes and turbo codes. This study describes an application of the BCJR algorithm for decoding the output of a multiple-access channel called the noisy three-user binary adder channel, in the presence of additive white Gaussian noise. The computer simulation results are presented for the overall coding performance in terms of bit error rate against signal-to-noise ratio.
Hilbert curve describes a one-to-one mapping between multidimensional space and 1 D *** traditional 3D Hilbert encoding and decoding algorithms work on order-wise manner and are not aware of the difference between dif...
详细信息
Hilbert curve describes a one-to-one mapping between multidimensional space and 1 D *** traditional 3D Hilbert encoding and decoding algorithms work on order-wise manner and are not aware of the difference between different input data and spend equivalent computing costs on them, thus resulting in a low efficiency. To solve this problem, in this paper we design efficient 3D state views for fast encoding and decoding. Based on the state views designed, a new encoding algorithm(JFK-3HE) and a new decoding algorithm(JFK-3HD) are proposed. JFK-3HE and JFK-3HD can avoid executing iteratively encoding or decoding each order by skipping the first 0 s in input data, thus decreasing the complexity and improving the efficiency. Experimental results show that JFK-3HE and JFK-3HD outperform the state-of-the-arts algorithms for both uniform and skew-distributed data.
Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation due to their robustness against errors and their local interactions between qubits. However, decoding th...
详细信息
Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation due to their robustness against errors and their local interactions between qubits. However, decoding these codes efficiently remains a challenge: existing decoders often fall short of meeting requirements such as having low computational complexity (ideally linear in the code's blocklength), low decoding latency, and low power consumption. In this paper we propose a novel bit-flipping (BF) decoder tailored for toric and surface codes. We introduce the proximity vector as a heuristic metric for flipping bits, and we develop a new subroutine for correcting degenerate multiple errors on adjacent qubits. Our algorithm has quadratic complexity growth and it can be efficiently implemented as it does not require operations on dynamic memories, as do state-of-art decoding algorithms such as minimum weight perfect matching or union find. The proposed decoder shows a decoding threshold of 7.5% for the 2D toric code and 7% for the rotated planar code over the binary symmetric channel.
Cassuto and Blaum presented a new coding framework for channels whose outputs are overlapping pairs of symbols in storage applications. Such channels are called symbol-pair read channels. Pair distance and pair error ...
详细信息
Cassuto and Blaum presented a new coding framework for channels whose outputs are overlapping pairs of symbols in storage applications. Such channels are called symbol-pair read channels. Pair distance and pair error are used in symbol-pair read channels. Yaakobi et al. proved a lower bound on the minimum pair distance of cyclic codes. Furthermore, they provided a decoding algorithm for correcting pair errors using a decoder for cyclic codes, and showed the number of pair errors that can be corrected by their algorithm. However, their algorithm cannot correct all pair error vectors within half of the minimum pair distance. In this paper, we propose an efficient decoding algorithm for cyclic codes over symbol-pair read channels. It is based on the relationship between pair errors and syndromes. In addition, we show that the proposed algorithm can correct more pair errors than Yaakobi's algorithm.
In the coding theory, it is one of the most important research problems to find an efficient algorithm for the decoding process. A quantum computer is an innovative computing device that performs calculations using th...
详细信息
In the coding theory, it is one of the most important research problems to find an efficient algorithm for the decoding process. A quantum computer is an innovative computing device that performs calculations using the principles of quantum mechanics. In this paper, we find a decoding algorithm for binary linear codes using quantum circuits;this is the first time that quantum circuits are used as a main tool for decoding binary linear codes. Our decoding algorithm is mainly based on Grover's search algorithm. In detail, we study the process of implementing the exhaustive search using quantum circuits for decoding binary linear codes. For our purpose, we design a modified Grover's algorithm (algorithm 1) using three tools: the matrix multiplier, the Hamming weight counter, and the state indicator. We present algorithm 2, which is a quantum decoding algorithm for binary linear codes. We illustrate algorithm 1 using the [7, 4, 3] Hamming code, and algorithm 2 is implemented by IBM Quantum Composer.
From the perspective of parity-check matrices, we present new constructions of q -ary maximum distance separable (MDS) array codes with multiple parities. Applying these constructions, some new types of MDS array code...
详细信息
From the perspective of parity-check matrices, we present new constructions of q -ary maximum distance separable (MDS) array codes with multiple parities. Applying these constructions, some new types of MDS array codes with array numbers m-tau can be derived, where gcd(m,q)=1 . Moreover, an explicit construction of binary MDS array codes is also presented. Compared to the existing MDS array codes, one important characteristic of these codes is that their available code lengths are much longer, which is suitable for large-scale storage systems. In some particular cases, the maximum code lengths of these codes and their extension can be up to 2(m-tau) and 2(m-tau)+1 (or 2(m-tau)+2 ), respectively. Moreover, to demonstrate the applicability of our constructed MDS array codes, we present an effective generic decoding method for the erased errors. In particular, when there are no more than three erasures occurring, a scheduled algorithm for the syndrome computation of our explicit construction is further proposed, whose computational complexity is asymptotically optimal. Furthermore, this algorithm can be directly applied to the encoding procedure of their extended form. The simulation shows that our new MDS array codes have better encoding and decoding performances than the corresponding extended RS codes coupled with different algorithms.
In this paper, a two-staged decoding strategy which can be used for the Weighted Bit Flipping (WBF) based decoding algorithm for LDPC codes is presented. At the two stages, a parallel WBF and bit-flipping (BF) algorit...
详细信息
In this paper, a two-staged decoding strategy which can be used for the Weighted Bit Flipping (WBF) based decoding algorithm for LDPC codes is presented. At the two stages, a parallel WBF and bit-flipping (BF) algorithms are adopted separately. Correspondingly, by the study of the iterative decoding process of the PWBF algorithm, a simple function is introduced to dynamically implement the switch of two decoding stages. The proposed algorithm can noticeably lower the error floor of PWBF algorithm with a modest increase in computation complexity and hardware cost. The validation of the proposed algorithm is verified by simulation.
The written-in errors in bit patterned media (BPM) recording systems cause the erroneous bits during the writing process, leading to performance degradation. In previous works, the BPM read/write channel is modeled as...
详细信息
ISBN:
(纸本)9786163618238
The written-in errors in bit patterned media (BPM) recording systems cause the erroneous bits during the writing process, leading to performance degradation. In previous works, the BPM read/write channel is modeled as a binary symmetric channel (BSC) with an additive white Gaussian noise (AWGN) channel or the cascaded BSC-AWGN channels. The initial channel information including the written-in errors probability has been proposed for low-density parity check (LDPC) decoder. However, the decoding algorithm remains the same as in the case of AWGN channels. In this work, we show that the crossover probability of BSC channels will affect the check node processing of LDPC codes. Therefore, we modify the check node computation that takes into account of the crossover probability of BSC channels. The simulation results show that the proposed LDPC decoder outperforms the ones with the conventional and modified likelihood function in terms of the bit error rate performance.
暂无评论