Gregory E. Coxson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2019

Filtering DC Bias in a Hard-Limited Radar Signal Processor Using Code ImbalanceGregory E. Coxson. taes, 55(4):1785-1793, 2019. [doi]

2017

Binary Complementary Code Structure via a Simple Necessary ConditionGregory E. Coxson, William Haloupek, Jon C. Russo. taes, 53(4):1846-1854, 2017. [doi]

Enumeration and Generation of PSL Equivalence Classes for Quad-Phase Codes of Even LengthGregory E. Coxson, Jon C. Russo. taes, 53(4):1907-1915, 2017. [doi]

2015

The structure of sidelobe-preserving operator groupsGregory E. Coxson, Dennis Spellman. taes, 51(2):1337-1346, 2015. [doi]

2014

Adiabatic quantum computing for finding low-peak-sidelobe codesGregory E. Coxson, Connie R. Hill, Jon C. Russo. hpec 2014: 1-6 [doi]

Row-correlation function: A new approach to complementary code matricesGregory E. Coxson, Brooke Logan, Hieu D. Nguyen. allerton 2014: 1357-1361 [doi]

2013

Efficient exhaustive search for binary complementary code setsGregory E. Coxson, Jon C. Russo. ciss 2013: 1-6 [doi]

Construction of Complementary Code Matrices for Waveform DesignGregory E. Coxson, William Haloupek. taes, 49(3):1806-1816, 2013. [doi]

1999

Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-HardGregory E. Coxson. rc, 5(2):137-142, 1999. [doi]

1994

The P-matrix problem is co-NP-completeGregory E. Coxson. mp, 64:173-178, 1994.

Remarks on an affinity condition in "a survey of extreme point results for robustness of control systems"Gregory E. Coxson. automatica, 30(5):915-916, 1994. [doi]

The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrixGregory E. Coxson, Christopher L. DeMarco. mcss, 7(4):279-291, 1994. [doi]

Sign in or sign up to see more results.

runs on WebDSL