Citations (8)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (4)
P. S. MOHARIR. (1975) Secrecy coding by Fourier-Kronecker pruning of certain transforms. International Journal of Electronics 39:5, pages 539-543.
Read now
Read now
P. S. MOHARIR. (1975) Block- and strand-multiplexing for fast computation of a class of transforms. International Journal of Electronics 38:3, pages 401-412.
Read now
Read now
P. S. Moharir. (1974) Walsh-Fourier and Trigonometric Secrecy Coding. IETE Journal of Research 20:5, pages 170-173.
Read now
Read now
P. S. Moharir. (1973) Recursively Adaptive Quantization of Chebyshev Coefficients. IETE Journal of Research 19:5, pages 235-238.
Read now
Read now
Articles from other publishers (4)
Adrian Dudek & Jerzy Baranowski. (2023) Chebyshev Polynomials for Efficient Gaussian Process Computation. Chebyshev Polynomials for Efficient Gaussian Process Computation.
Pieter Appeltans & Wim Michiels. (2023) A Structure Preserving Shift-Invert Infinite Arnoldi Algorithm for a Class of Delay Eigenvalue Problems with Hamiltonian Symmetry. SIAM Journal on Matrix Analysis and Applications 44:1, pages 331-358.
Crossref
Crossref
Xin An, Anton Artemyev, Vassilis Angelopoulos, San Lu, Philip Pritchett & Viktor Decyk. (2022) Fast Inverse Transform Sampling of Non‐Gaussian Distribution Functions in Space Plasmas. Journal of Geophysical Research: Space Physics 127:5.
Crossref
Crossref
Sven Weisbrich, Georgios Malissiovas & Frank Neitzel. (2021) On the fast approximation of point clouds using Chebyshev polynomials. Journal of Applied Geodesy 15:4, pages 305-317.
Crossref
Crossref