Related papers: Arithmetic Operators over Finite Field GF($2^m$) f…
Is perfect error correction always worth the trouble? A framework is presented for the analysis of error detection and correction in multi-level systems of communication that takes into account degrees of freedom attended and ignored by…
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a…
In this paper we devise a rational curve fitting algorithm and apply it to the list decoding of Reed-Solomon and BCH codes. The proposed list decoding algorithms exhibit the following significant properties. 1 The algorithm corrects up to…
The paper has a threefold purpose. The first purpose is to present an explicit description of expanded cyclic codes defined in $\GF(q^m)$. The proposed explicit construction of expanded generator matrix and expanded parity check matrix…
We present a new general method for performing basic arithmetic in the finite field~$\mathbb{F}_p$ for any prime $p>2$ by using traditional binary operations over~$\mathbb{F}_2$. Our new approach is efficient and competitive with current…
Recently, codes in the sum-rank metric attracted attention due to several applications in e.g. multishot network coding, distributed storage and quantum-resistant cryptography. The sum-rank analogs of Reed-Solomon and Gabidulin codes are…
Generalized Reed-Solomon (RS) codes are a common choice for efficient, reliable error correction in memory and communications systems. These codes add $2t$ extra parity symbols to a block of memory, and can efficiently and reliably correct…
Let $q=p^h$ be a prime power and $e$ be an integer with $0\leq e\leq h-1$. $e$-Galois self-orthogonal codes are generalizations of Euclidean self-orthogonal codes ($e=0$) and Hermitian self-orthogonal codes ($e=\frac{h}{2}$ and $h$ is…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
In this work we present some results that allow to improve the decoding radius in solving polynomial linear systems with errors in the scenario where errors are additive and randomly distributed over a finite field. The decoding radius…
The classical convergence analysis of quasi-Newton methods assumes that the function and gradients employed at each iteration are exact. In this paper, we consider the case when there are (bounded) errors in both computations and establish…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
A mathematics student's first introduction to the fundamental theorem of finite fields (FTFF) often occurs in an advanced abstract algebra course and invokes the power of Galois theory to prove it. Yet the combinatorial and algebraic coding…
Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily…
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider…
Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length. In many applications where the length is…
Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…
We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…
A general class of polynomial remainder codes is considered. Such codes are very flexible in rate and length and include Reed-Solomon codes as a special case. As an extension of previous work, two joint error-and-erasure decoding approaches…