Daniel J. Katz

Orcid: 0000-0002-0214-8506

According to our database1, Daniel J. Katz authored at least 34 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Sequences with identical autocorrelation spectra.
CoRR, 2023

Almost perfect nonlinear power functions with exponents expressed as fractions.
CoRR, 2023

Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences.
CoRR, 2023

Moments of Autocorrelation Demerit Factors of Binary Sequences.
CoRR, 2023

Rationality of Four-Valued Families of Weil Sums of Binomials.
CoRR, 2023

2022
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation.
IEEE Trans. Inf. Theory, 2022

Peak Sidelobe Level and Peak Crosscorrelation of Golay-Rudin-Shapiro Sequences.
IEEE Trans. Inf. Theory, 2022

2021
The Resolution of Niho's Last Conjecture Concerning Sequences, Codes, and Boolean Functions.
IEEE Trans. Inf. Theory, 2021

Sets of Low Correlation Sequences from Cyclotomy.
CoRR, 2021

2020
Rudin-Shapiro-Like Sequences With Maximum Asymptotic Merit Factor.
IEEE Trans. Inf. Theory, 2020

2018
On Chebotarëv's nonvanishing minors theorem and the Biró-Meshulam-Tao discrete uncertainty principle.
CoRR, 2018

Weil sums of binomials: properties and applications.
CoRR, 2018

Sequences with Low Correlation.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

2017
Low Correlation Sequences From Linear Combinations of Characters.
IEEE Trans. Inf. Theory, 2017

Rudin-Shapiro-Like Polynomials with Maximum Asymptotic Merit Factor.
CoRR, 2017

Crosscorrelation of Rudin-Shapiro-Like Polynomials.
CoRR, 2017

2016
Aperiodic Crosscorrelation of Sequences Derived From Characters.
IEEE Trans. Inf. Theory, 2016

Low Correlation Sequences from Linear Combinations of Characters.
CoRR, 2016

On the Number of Similar Instances of a Pattern in a Finite Set.
Electron. J. Comb., 2016

New open problems related to old conjectures by Helleseth.
Cryptogr. Commun., 2016

2014
Proof of a Conjectured Three-Valued Family of Weil Sums of Binomials.
CoRR, 2014

Divisibility of Weil Sums of Binomials.
CoRR, 2014

2013
Advances in the merit factor problem for binary sequences.
J. Comb. Theory, Ser. A, 2013

Cyclotomy of Weil Sums of Binomials.
CoRR, 2013

2012
Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth.
J. Comb. Theory, Ser. A, 2012

On theorems of Delsarte-McEliece and Chevalley-Warning-Ax-Katz.
Des. Codes Cryptogr., 2012

Asymptotic $L^4$ norm of polynomials derived from characters
CoRR, 2012

Littlewood Polynomials with Small $L^4$ Norm
CoRR, 2012

2011
Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period 2<sup>2<sup>n</sup></sup>-1 Never Have Three-Valued Cross-Correlation.
CoRR, 2011

2010
Correction to "Sharp p -Divisibility of Weights in Abelian Codes Over BBZ/p<sup>dBBZ</sup> " [Dec 08 5354-5380].
IEEE Trans. Inf. Theory, 2010

2008
Sharp p -Divisibility of Weights in Abelian Codes Over BBZ/p<sup>dBBZ</sup>.
IEEE Trans. Inf. Theory, 2008

Bounds on degrees of p-adic separating polynomials.
J. Comb. Theory, Ser. A, 2008

2006
p-Adic estimates of hamming weights in abelian codes over galois rings.
IEEE Trans. Inf. Theory, 2006

2005
p-Adic valuation of weights in Abelian codes over ℤ(p<sup>d</sup>).
IEEE Trans. Inf. Theory, 2005


  Loading...