H. Olkkonen and J. T. Olkkonen, “Log-Time Sampling of Signals: Zeta Transform,” Open Journal of Discrete Mathematics, Vol. 1, No. 2, 2011, pp. 62-65. doi:10.4236/ojdm.2011.12008
has been cited by the following article:
TITLE: Fast Converging Series for Riemann Zeta Function
AUTHORS: Hannu Olkkonen, Juuso T. Olkkonen
KEYWORDS: Riemann Zeta Function; Converging Series; Number Theory; Cryptography; Signal Processing
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.4, November 1, 2012
ABSTRACT: Riemann zeta function has a key role in number theory and in its applications. In this paper we present a new fast converging series for . Applications of the series include the computation of the and recursive computation of , and generally . We discuss on the production of irrational number sequences e.g. for encryption coding and zeta function maps for analysis and synthesis of log-time sampled signals.