On decoding interleaved reed-solomon codes

Download

index.pdf

Date

2011

Author

Yayla, Oğuz

Metadata

Show full item record

Item Usage Stats

201
views

93
downloads

Probabilistic simultaneous polynomial reconstruction algorithm of Bleichenbacher-Kiayias-Yung is extended to the polynomials whose degrees are allowed to be distinct. Furthermore, it is observed that probability of the algorithm can be increased. Specifically, for a finite field $\F$, we present a probabilistic algorithm which can recover polynomials $p_1,\ldots, p_r \in \F[x]$ of degree less than $k_1,k_2,\ldots,k_r$, respectively with given field evaluations $p_l(z_i) = y_{i,l}$ for all $i \in I$, $

Subject Keywords

Reed-Solomon codes., Ciphers.

URI

http://etd.lib.metu.edu.tr/upload/12613621/index.pdf
https://hdl.handle.net/11511/21239

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes Özbudak, Ferruh (Elsevier BV, 2014-02-06) Probabilistic simultaneous polynomial reconstruction algorithm of Bleichenbacher, Kiayias, and Yung is extended to the polynomials whose degrees are allowed to be distinct. Specifically, for a finite field F, positive integers n, r, t and distinct elements z(1), z(2), ... , z(n) is an element of F, we present a probabilistic algorithm which can recover polynomials p(1), p(2), p(r) is an element of F[x] of degree less than k(1), k(2), ... , k(r) respectively for a given instance < y(i), (1, ... ,) y(i,r)>(n)...
Exact Solutions of Some Partial Differential Equations Using the Modified Differential Transform Method Cansu Kurt, Ümmügülsüm; Ozkan, Ozan (2018-03-01) In this paper, we present the modification of the differential transform method by using Laplace transform and Pade approximation to obtain closed form solutions of linear and nonlinear partial differential equations. Some illustrative examples are given to demonstrate the activeness of the proposed technique. The obtained results ensure that this modified method is capable of solving a large number of linear and nonlinear PDEs that have wide application in science and engineering. It solves the drawbacks i...
On the computation of generalized division polynomials Küçüksakallı, Ömer (2015-01-01) We give an algorithm to compute the generalized division polynomials for elliptic curves with complex multiplication. These polynomials can be used to generate the ray class fields of imaginary quadratic fields over the Hilbert class field with no restriction on the conductor.
EXACT SPIN AND PSEUDO-SPIN SYMMETRIC SOLUTIONS OF THE DIRAC-KRATZER PROBLEM WITH A TENSOR POTENTIAL VIA LAPLACE TRANSFORM APPROACH Arda, Altug; Sever, Ramazan (2012-09-28) Exact bound state solutions of the Dirac equation for the Kratzer potential in the presence of a tensor potential are studied by using the Laplace transform approach for the cases of spin- and pseudo-spin symmetry. The energy spectrum is obtained in the closed form for the relativistic as well as non-relativistic cases including the Coulomb potential. It is seen that our analytical results are in agreement with the ones given in the literature. The numerical results are also given in a table for different p...
On generalized semi-infinite programming - Discussion Weber, Gerhard Wilhelm; Tezel, A. (2006-06-01) This paper surveys some basic properties of the class of generalized semi-infinite programming problems (GSIP) where the infinite index set of inequality constraints depends on the state variables and all emerging functions are assumed to be continuously differentiable. There exists a wide range of applications which can be modelled as a (GSIP). The paper discusses extensions of the Mangasarian-Fromovitz, Kuhn-Tucker and Abadie constraint qualification to (GSIP) and presents related first order optimality c...

Citation Formats

O. Yayla, “On decoding interleaved reed-solomon codes,” Ph.D. - Doctoral Program, Middle East Technical University, 2011.