default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReza Omrani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j2]Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia
, Pankaj Bhambhani:
Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes. IEEE Trans. Inf. Theory 58(2): 1163-1185 (2012)- 2007
- [j1]Oscar Moreno, Reza Omrani, P. Vijay Kumar, Hsiao-feng Lu:
A Generalized Bose-Chowla Family of Optical Orthogonal Codes and Distinct Difference Sets. IEEE Trans. Inf. Theory 53(5): 1907-1910 (2007)
Conference and Workshop Papers
- 2013
- [c14]Reza Omrani, Lina Kattan:
Simultaneous calibration of microscopic traffic simulation model and estimation of origin/destination (OD) flows based on genetic algorithms in a high-performance computer. ITSC 2013: 2316-2321 - 2007
- [c13]Reza Omrani, Pankaj Bhambhani, P. Vijay Kumar:
Sequences for Phase-Encoded Optical CDMA. SSC 2007: 95-105 - 2006
- [c12]Oscar Moreno, Reza Omrani, Svetislav V. Maric:
A New Construction of Multiple Target Sonar and Extended Costas Arrays with Perfect Correlation. CISS 2006: 512-517 - [c11]P. Vijay Kumar, Reza Omrani, Joe Touch, Alan E. Willner, Poorya Saghari:
A Novel Optical CDMA Modulation Scheme: Code Cycle Modulation. GLOBECOM 2006 - [c10]Oscar Moreno, Reza Omrani, Svetislav V. Maric:
Doubly Periodic Arrays and a New Construction of Multiple Target Sonar and Extended Costas Arrays with Perfect Correlation. ISIT 2006: 1643-1647 - [c9]Oscar Moreno, Reza Omrani, P. Vijay Kumar, Solomon W. Golomb:
OOCs, Partial Relative Difference Families and a Conjecture of Golomb. ISIT 2006: 2632-2636 - [c8]Reza Omrani, P. Vijay Kumar:
Spreading Sequences for Asynchronous Spectrally Phase Encoded Optical CDMA. ISIT 2006: 2642-2646 - [c7]Reza Omrani, P. Vijay Kumar:
Codes for Optical CDMA. SETA 2006: 34-46 - 2005
- [c6]Reza Omrani, P. Vijay Kumar:
Improved constructions and bounds for 2-D optical orthogonal codes. ISIT 2005: 127-131 - [c5]Reza Omrani, Oscar Moreno, P. Vijay Kumar:
Improved Johnson bounds for optical orthogonal codes with λ > 1 and some optimal constructions. ISIT 2005: 259-263 - 2004
- [c4]Yuankai Wang, Reza Omrani, Keith M. Chugg, P. Vijay Kumar:
Low-density parity-check space-time codes: performance analysis and code construction. ISIT 2004: 156 - [c3]Reza Omrani, Oscar Moreno, P. Vijay Kumar:
Optimal optical orthogonal codes with lambda > 1. ISIT 2004: 366 - [c2]Reza Omrani, Petros Elia, P. Vijay Kumar:
New Constructions and Bounds for 2-D Optical Orthogonal Codes. SETA 2004: 389-395 - [c1]Reza Omrani, Oscar Moreno, P. Vijay Kumar:
Topics on Optical Orthogonal Codes. SETA 2004: 396-405
Informal and Other Publications
- 2009
- [i1]Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia, Pankaj Bhambhani:
Large Families of Optimal Two-Dimensional Optical Orthogonal Codes. CoRR abs/0911.0143 (2009)
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-04-24 23:18 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:
