output
19942026
most citedAverage Time Spent by Levy Flights and Walks on an Interval with Absorbing Boundaries

144 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2013

Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes

Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau +1

Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a…

cs.IT2012

A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes

Alexander Zeh, Sergey Bezzateev

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH…

cs.IT2012★ 2 cited

Describing A Cyclic Code by Another Cyclic Code

Alexander Zeh, Sergey Bezzateev

A new approach to bound the minimum distance of -ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for se…

cs.IT2011★ 11 cited

A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree

Sergei V. Fedorenko

A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be…

cs.IT2007

Chain of Separable Binary Goppa Codes and their Minimal Distance

Sergey Bezzateev, Natalia Shekhunova

It is shown that subclasses of separable binary Goppa codes, - codes, with and special Goppa polynomials G(x) can be presented as a cha…