default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammadali Khosravifard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Shima Kheradmand
, Mohammadali Khosravifard, Sayed Jalal Zahabi, Hamed Narimani:
Improved Upper Bounds on the Average Redundancy of Optimal RVLC. IEEE Trans. Commun. 72(5): 2552-2562 (2024)- 2023
- [j25]Sayed Jalal Zahabi, Hamed Narimani, Mohammadali Khosravifard:
On the Shortest Codeword of the Optimal RVLC. IEEE Trans. Inf. Theory 69(7): 4740-4745 (2023) - 2020
- [j24]Hamed Narimani, Mohammadali Khosravifard:
A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size. IEEE Trans. Inf. Theory 66(3): 1474-1481 (2020) - [j23]Mohammad Javad-Kalbasi, Mohammadali Khosravifard:
Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes. IEEE Trans. Inf. Theory 66(7): 4419-4430 (2020)
2010 – 2019
- 2015
- [j22]Adel Aghajan, Sayed Jalal Zahabi, Mohammadali Khosravifard, T. Aaron Gulliver:
On the source-channel separation theorem for infinite source alphabets. Probl. Inf. Transm. 51(2): 200-204 (2015) - [j21]Sayed Jalal Zahabi, Mohammadali Khosravifard:
The Most Likely Optimal Symmetric RVLC. IEEE Trans. Commun. 63(11): 4142-4149 (2015) - [j20]Sayed Jalal Zahabi, Mohammadali Khosravifard:
On the Penalty of Optimal Fix-Free Codes. IEEE Trans. Inf. Theory 61(5): 2776-2787 (2015) - [j19]Shima Kheradmand, Mohammadali Khosravifard, T. Aaron Gulliver:
The Redundancy of an Optimal Binary Fix-Free Code Is Not Greater Than 1 bit. IEEE Trans. Inf. Theory 61(6): 3549-3558 (2015) - [j18]Adel Aghajan, Mohammadali Khosravifard:
Optimal Codes With Limited Kraft Sum. IEEE Trans. Inf. Theory 61(11): 6385-6394 (2015) - 2014
- [j17]Parvin Rastegari, Mohammadali Khosravifard, Hamed Narimani, T. Aaron Gulliver:
On the Structure of the Minimum Average Redundancy Code for Monotone Sources. IEEE Commun. Lett. 18(4): 664-667 (2014) - [j16]Sayed Jalal Zahabi, Adel Aghajan, Mohammadali Khosravifard:
Sequentially-Constructible Reversible Variable Length Codes. IEEE Trans. Commun. 62(8): 2605-2614 (2014) - [j15]Alireza Rezvanifar, Mohammadali Khosravifard:
Including the Size of Regions in Image Segmentation by Region-Based Graph. IEEE Trans. Image Process. 23(2): 635-644 (2014) - [j14]Hamed Narimani, Mohammadali Khosravifard:
Huffman Redundancy for Large Alphabet Sources. IEEE Trans. Inf. Theory 60(3): 1412-1427 (2014) - [j13]Adel Aghajan, Mohammadali Khosravifard:
Weakly Symmetric Fix-Free Codes. IEEE Trans. Inf. Theory 60(9): 5500-5515 (2014) - [c5]Sayed Jalal Zahabi, Mohammadali Khosravifard:
A note on the redundancy of reversible variable length codes. IWCIT 2014: 1-6 - 2013
- [j12]Hamed Narimani, Mohammadali Khosravifard, T. Aaron Gulliver:
How Suboptimal Is the Shannon Code? IEEE Trans. Inf. Theory 59(1): 458-471 (2013) - [j11]Adel Aghajan, Mohammadali Khosravifard:
93% of the $ {{ 3}\over { 4}}$-Conjecture Is Already Verified. IEEE Trans. Inf. Theory 59(12): 8182-8194 (2013) - [j10]Sayed Jalal Zahabi, Naghmeh Sadat Moayedian, Mohammadali Khosravifard, Sonia Aïssa:
Bounds on Throughput of CSMA in Weibull Fading Channels. IEEE Wirel. Commun. Lett. 2(6): 639-642 (2013) - 2012
- [j9]Mohammadali Khosravifard, Hamed Narimani, T. Aaron Gulliver:
A Simple Recursive Shannon Code. IEEE Trans. Commun. 60(2): 295-299 (2012) - [j8]Mohammadali Khosravifard, Shima Kheradmand:
Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes. IEEE Trans. Inf. Theory 58(6): 4049-4057 (2012) - 2011
- [j7]Hamed Narimani, Mohammadali Khosravifard, T. Aaron Gulliver:
Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2092-2096 (2011) - [j6]Sayed Jalal Zahabi, Mohammadali Khosravifard, AliAkbar Tadaion, T. Aaron Gulliver:
Signal Activity Detection of Offset-QPSK in Colored Gaussian Noise. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2226-2229 (2011) - 2010
- [j5]Mohammadali Khosravifard, Hassan Halabian, T. Aaron Gulliver:
A Kraft-type sufficient condition for the existence of D-ary fix-free codes. IEEE Trans. Inf. Theory 56(6): 2920-2927 (2010)
2000 – 2009
- 2009
- [j4]Mohammadali Khosravifard, Morteza Esmaeili, Hossein Saidi:
Extension of the Lasserre-Avrachenkov theorem on the integral of multilinear forms over simplices. Appl. Math. Comput. 212(1): 94-99 (2009) - [c4]M. R. Heidarpour, Mahmoud Modarres-Hashemi, Mohammadali Khosravifard, T. Aaron Gulliver:
Improving the Performance of LP Decoders for Cyclic Codes. ICC 2009: 1-5 - [c3]T. Aaron Gulliver, Hamed Narimani, Mohammadali Khosravifard:
Two recursive versions of the Shannon code. ISIT 2009: 209-213 - 2007
- [j3]Mohammadali Khosravifard, Dariush Fooladivanda, T. Aaron Gulliver:
Confliction of the Convexity and Metric Properties in f-Divergences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(9): 1848-1853 (2007) - [j2]Mohammadali Khosravifard, Hossein Saidi, Morteza Esmaeili, T. Aaron Gulliver:
The Minimum Average Code for Finite Memoryless Monotone Sources. IEEE Trans. Inf. Theory 53(3): 955-975 (2007) - 2006
- [c2]Mohammadali Khosravifard, Hossein Saidi, Morteza Esmaeili, T. Aaron Gulliver:
The Average Performance of the Minimax Code. ISIT 2006: 587-591 - 2003
- [j1]Mohammadali Khosravifard, Morteza Esmaeili, Hossein Saidi, T. Aaron Gulliver:
A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2510-2516 (2003) - 2002
- [c1]Mohammadali Khosravifard, T. Aaron Gulliver, Mohammadali Esmaeili, Hossein Saidi:
The minimum average code for finite memoryless monotone sources. ITW 2002: 135-138
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
