default search action
Gregory Emmett Coxson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j13]Gregory Emmett Coxson
:
Golay Pairs Having Larger Swap Sets. IEEE Trans. Aerosp. Electron. Syst. 57(1): 738-743 (2021) - [j12]Gregory Emmett Coxson
Shared-ACS Binary Code Pair Search Exploiting Coupled Symparity. IEEE Trans. Aerosp. Electron. Syst. 57(3): 1455-1461 (2021) - 2020
- [j11]Gregory Emmett Coxson
Enumeration and Generation of $\rm PSL$ Equivalence Classes for Quad-Phase Codes of Odd Length. IEEE Trans. Aerosp. Electron. Syst. 56(2): 863-870 (2020)
2010 – 2019
- 2019
- [j10]Gregory Emmett Coxson
Filtering DC Bias in a Hard-Limited Radar Signal Processor Using Code Imbalance. IEEE Trans. Aerosp. Electron. Syst. 55(4): 1785-1793 (2019) - [j9]Gregory Emmett Coxson
Shared-Autocorrelation Binary Codes Found by Exhaustive Search. IEEE Trans. Aerosp. Electron. Syst. 55(6): 3578-3586 (2019) - 2017
- [j8]Gregory Emmett Coxson, William Haloupek, Jon Carmelo Russo:
Binary Complementary Code Structure via a Simple Necessary Condition. IEEE Trans. Aerosp. Electron. Syst. 53(4): 1846-1854 (2017) - [j7]Gregory Emmett Coxson, Jon Carmelo Russo:
Enumeration and Generation of PSL Equivalence Classes for Quad-Phase Codes of Even Length. IEEE Trans. Aerosp. Electron. Syst. 53(4): 1907-1915 (2017) - 2015
- [j6]Gregory Emmett Coxson, Dennis Spellman:
The structure of sidelobe-preserving operator groups. IEEE Trans. Aerosp. Electron. Syst. 51(2): 1337-1346 (2015) - 2014
- [c3]Gregory Emmett Coxson, Brooke Logan, Hieu D. Nguyen
Row-correlation function: A new approach to complementary code matrices. Allerton 2014: 1357-1361 - [c2]Gregory Emmett Coxson, Connie R. Hill, Jon Carmelo Russo:
Adiabatic quantum computing for finding low-peak-sidelobe codes. HPEC 2014: 1-6 - [i1]Hieu D. Nguyen, Greg E. Coxson:
Doppler Tolerance, Complementary Code Sets and the Generalized Thue-Morse Sequence. CoRR abs/1406.2076 (2014) - 2013
- [j5]Gregory Emmett Coxson, William Haloupek:
Construction of Complementary Code Matrices for Waveform Design. IEEE Trans. Aerosp. Electron. Syst. 49(3): 1806-1816 (2013) - [c1]Gregory Emmett Coxson, Jon Carmelo Russo:
Efficient exhaustive search for binary complementary code sets. CISS 2013: 1-6
1990 – 1999
- 1999
- [j4]Gregory Emmett Coxson:
Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-Hard. Reliab. Comput. 5(2): 137-142 (1999) - 1994
- [j3]Gregory Emmett Coxson:
Remarks on an affinity condition in "a survey of extreme point results for robustness of control systems". Autom. 30(5): 915-916 (1994) - [j2]Gregory Emmett Coxson, Christopher L. DeMarco:
The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix. Math. Control. Signals Syst. 7(4): 279-291 (1994) - [j1]Gregory Emmett Coxson:
The P-matrix problem is co-NP-complete. Math. Program. 64: 173-178 (1994)
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-25 05:49 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: