Gregory Emmett Coxson

Orcid: 0000-0003-0178-7098

According to our database1, Gregory Emmett Coxson authored at least 17 papers between 1994 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Shared-ACS Binary Code Pair Search Exploiting Coupled Symparity.
IEEE Trans. Aerosp. Electron. Syst., 2021

Golay Pairs Having Larger Swap Sets.
IEEE Trans. Aerosp. Electron. Syst., 2021

2020
Enumeration and Generation of $\rm PSL$ Equivalence Classes for Quad-Phase Codes of Odd Length.
IEEE Trans. Aerosp. Electron. Syst., 2020

2019
Shared-Autocorrelation Binary Codes Found by Exhaustive Search.
IEEE Trans. Aerosp. Electron. Syst., 2019

Filtering DC Bias in a Hard-Limited Radar Signal Processor Using Code Imbalance.
IEEE Trans. Aerosp. Electron. Syst., 2019

2017
Enumeration and Generation of PSL Equivalence Classes for Quad-Phase Codes of Even Length.
IEEE Trans. Aerosp. Electron. Syst., 2017

Binary Complementary Code Structure via a Simple Necessary Condition.
IEEE Trans. Aerosp. Electron. Syst., 2017

2015
The structure of sidelobe-preserving operator groups.
IEEE Trans. Aerosp. Electron. Syst., 2015

2014
Doppler Tolerance, Complementary Code Sets and the Generalized Thue-Morse Sequence.
CoRR, 2014

Adiabatic quantum computing for finding low-peak-sidelobe codes.
Proceedings of the IEEE High Performance Extreme Computing Conference, 2014

Row-correlation function: A new approach to complementary code matrices.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Construction of Complementary Code Matrices for Waveform Design.
IEEE Trans. Aerosp. Electron. Syst., 2013

Efficient exhaustive search for binary complementary code sets.
Proceedings of the 47th Annual Conference on Information Sciences and Systems, 2013

1999
Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-Hard.
Reliab. Comput., 1999

1994
The P-matrix problem is co-NP-complete.
Math. Program., 1994

The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix.
Math. Control. Signals Syst., 1994

Remarks on an affinity condition in "a survey of extreme point results for robustness of control systems".
Autom., 1994


  Loading...