distortion bound
Recently Published Documents


TOTAL DOCUMENTS

18
(FIVE YEARS 3)

H-INDEX

5
(FIVE YEARS 1)

2021 ◽  
Vol 2021 ◽  
pp. 1-5
Author(s):  
Muhammad Ghaffar Khan ◽  
Bakhtiar Ahmad ◽  
Maslina Darus ◽  
Wali Khan Mashwani ◽  
Shahid Khan

In this paper, we define a new class of Sakaguchi type-meromorphic harmonic functions in the Janowski domain that are starlike with respect to symmetric point. Furthermore, we investigate some important geometric properties like sufficiency criteria, distortion bound, extreme point theorem, convex combination, and weighted means.


Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1676
Author(s):  
Saeed Islam ◽  
Muhammad Ghaffar Khan ◽  
Bakhtiar Ahmad ◽  
Muhammad Arif ◽  
Ronnason Chinram

The main purpose of this article is to examine the q-analog of starlike functions connected with a trigonometric sine function. Further, we discuss some interesting geometric properties, such as the well-known problems of Fekete-Szegö, the necessary and sufficient condition, the growth and distortion bound, closure theorem, convolution results, radii of starlikeness, extreme point theorem and the problem with partial sums for this class.


2019 ◽  
Vol 30 (1) ◽  
pp. 125 ◽  
Author(s):  
Abdul Rahman S. Juma ◽  
Mushtaq S. Abdulhussain ◽  
Saba Nazar Al-khafaji

In this paper, we define and investigate subclass of Bazilevi´c type harmonic univalent functions related with a new linear operator. Also, we have obtained the harmonic structures in terms of its coefficient bounds, extreme points, distortion bound, convolution and we proved the function belongs to this class be closed under an integral operator.


2010 ◽  
Vol 58 (6) ◽  
pp. 1643-1653 ◽  
Author(s):  
Zhibin Sun ◽  
Mingkai Shao ◽  
Jun Chen ◽  
Kon Wong ◽  
Xiaolin Wu

2008 ◽  
Vol 2008 ◽  
pp. 1-5
Author(s):  
David Akopian

An optimal bit allocation is presented for classification-based source-dependent transform coding. A vector of transform coefficients is considered to have been produced by a mixture of processes. The available bit resource is distributed optimally in two stages: (1) bit allocation is performed for each class of coefficient vectors, and (2) bit allocation is performed for each vector coefficient. The solution for low bit rates imposing nonnegative bit resource is also presented. The rate-distortion bound of the classification-based source coding is derived.


Sign in / Sign up

Export Citation Format

Share Document