Peter D. Dragnev

Affiliations:
  • Purdue University, Fort Wayne, USA


According to our database1, Peter D. Dragnev authored at least 10 papers between 2010 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On the best uniform polynomial approximation to the checkmark function.
J. Approx. Theory, 2022

2021
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances.
IEEE Trans. Inf. Theory, 2021

Bounds for spherical codes: The Levenshtein framework lifted.
Math. Comput., 2021

2020
Upper bounds for energies of spherical codes of given cardinality and separation.
Des. Codes Cryptogr., 2020

2019
On spherical codes with inner products in a prescribed interval.
Des. Codes Cryptogr., 2019

On Two Problems Concerning Universal Bounds for Codes.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2017
Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4, 24)-Codes.
Electron. Notes Discret. Math., 2017

Energy bounds for codes and designs in Hamming spaces.
Des. Codes Cryptogr., 2017

2010
Asymptotic behavior and zero distribution of Carleman orthogonal polynomials.
J. Approx. Theory, 2010


  Loading...