Daniel Panario

From MaRDI portal
Person:169310

Available identifiers

zbMath Open panario.danielMaRDI QIDQ169310

List of research outcomes





PublicationDate of PublicationType
Revisiting linearly extended discrete functions2025-01-20Paper
Stable binomials over finite fields2024-12-27Paper
Quasi-polycyclic and skew quasi-polycyclic codes over \(\mathbb{F}_q\)2024-12-27Paper
Additive codes with few weights2024-11-26Paper
Girth analysis of quantum quasi-cyclic LDPC codes2024-11-06Paper
Construction of protograph-based LDPC codes with chordless short cycles2024-07-21Paper
Nilpotent linearized polynomials over finite fields, revisited2024-07-02Paper
An extension of a construction of covering arrays2024-02-01Paper
Linear label code of a root lattice using Gröbner bases2024-01-18Paper
https://portal.mardi4nfdi.de/entity/Q61465232024-01-12Paper
Ordered covering arrays and upper bounds on covering codes2023-11-09Paper
Infinitude of palindromic almost-prime numbers2023-07-31Paper
Comparing balanced sequences obtained from ElGamal function to random balanced sequences2023-07-03Paper
Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings \(\mathbb{F}_q[v_1,v_2,\dots,v_t]\)2023-07-03Paper
A Construction of Permutation Polynomials Using R\'{e}dei Function in Even Characteristic2023-05-05Paper
One-generator quasi-cyclic codes and their dual codes2023-04-20Paper
Functional graphs of generalized cyclotomic mappings of finite fields2023-03-31Paper
Feedback linearly extended discrete functions2023-02-28Paper
Evaluating the generalized Buchshtab function and revisiting the variance of the distribution of the smallest components of combinatorial objects2022-12-24Paper
Ordered Orthogonal Array Construction Using LFSR Sequences2022-07-30Paper
Bounds on Covering Codes in RT spaces using Ordered Covering Arrays2022-07-30Paper
Finding linearly generated subsequences2021-10-04Paper
https://portal.mardi4nfdi.de/entity/Q49935522021-06-15Paper
Periods of Iterations of Functions with Restricted Preimage Sizes2021-05-03Paper
Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels2021-02-22Paper
QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field2020-08-26Paper
A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes2020-08-26Paper
8. A survey on iterations of mappings over finite fields2020-07-27Paper
A trigonometric approach for Dickson polynomials over fields of characteristic two2020-07-15Paper
Unicyclic strong permutations2020-05-12Paper
Bounds on covering codes in RT spaces using ordered covering arrays2020-04-29Paper
Construction of irreducible polynomials through rational transformations2020-02-25Paper
Fixed points of rational functions satisfying the Carlitz property2019-12-18Paper
Bivariate Asymptotics for Striped Plane Partitions2019-09-16Paper
A General Construction of Ordered Orthogonal Arrays Using LFSRs2019-07-19Paper
The graph structure of Chebyshev polynomials over finite fields and applications2019-02-20Paper
The functional graph of linear maps over finite fields and applications2019-02-20Paper
Normal basis exhaustive search: 10 years later2019-02-15Paper
Non-homogeneous conditional recurrences2018-09-17Paper
A non-commutative cryptosystem based on quaternion algebras2018-09-06Paper
Nonlinear vectorial primitive recursive sequences2018-08-28Paper
Fast and Simple Modular Interpolation Using Factorial Representation2018-07-12Paper
A new class of irreducible pentanomials for polynomial based multipliers in binary fields2018-06-01Paper
Number of \(t\)-tuples in arrays from LFSRs2018-04-12Paper
Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)2018-03-16Paper
Covering arrays from \(m\)-sequences and character sums2017-10-27Paper
Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields2017-09-05Paper
A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form2017-07-27Paper
Two New Measures for Permutations: Ambiguity and Deficiency2017-07-12Paper
Ordered Orthogonal Array Construction Using LFSR Sequences2017-06-08Paper
Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map2017-06-08Paper
Cycle structure of iterating Rédei functions2017-05-22Paper
https://portal.mardi4nfdi.de/entity/Q29599122017-02-10Paper
https://portal.mardi4nfdi.de/entity/Q29598622017-02-10Paper
Computing Gröbner bases associated with lattices2016-11-11Paper
Erratum: ``On the heuristic of approximating polynomials over finite fields by random mappings2016-10-25Paper
On the heuristic of approximating polynomials over finite fields by random mappings2016-10-25Paper
Ambiguity and deficiency of reversed Dickson permutations2016-09-02Paper
A trigonometric approach for Chebyshev polynomials over finite fields2016-06-10Paper
General conditional recurrences2016-04-29Paper
Finite field constructions of combinatorial arrays2016-02-02Paper
Constructing new covering arrays from LFSR sequences over finite fields2015-12-17Paper
Linear complexity profile and correlation measure of interleaved sequences2015-11-19Paper
Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group2015-09-02Paper
An asymptotic formula for the number of irreducible transformation shift registers2015-08-24Paper
https://portal.mardi4nfdi.de/entity/Q55012912015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q52620562015-07-09Paper
Open Problems for Polynomials over Finite Fields and Applications2015-06-22Paper
Locating modifications in signed data for partial data integrity2015-06-15Paper
Adaptive sampling strategies for quickselects2014-11-18Paper
Approximating the number of irreducible polynomials over \(\mathbb F_2\) with several prescribed coefficients2014-11-04Paper
Existence and properties of \(k\)-normal elements over finite fields2014-04-29Paper
https://portal.mardi4nfdi.de/entity/Q54024572014-03-07Paper
Generalized Alcuin's sequence2013-06-07Paper
Subfield value sets of polynomials over finite fields2013-04-24Paper
Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)2013-04-04Paper
Cycle structure of permutation functions over finite fields and their applications2012-11-12Paper
Random Mappings with Restricted Preimages2012-09-21Paper
Word-Oriented Transformation Shift Registers and Their Linear Complexity2012-09-07Paper
In honour of the research and influence of Joachim von zur Gathen at 602012-05-04Paper
Interval partitions and polynomial factorization2012-04-26Paper
Divisibility of polynomials over finite fields and combinatorial applications2012-04-04Paper
A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields2012-03-22Paper
Enumeration of decomposable combinatorial structures with restricted patterns2012-01-24Paper
Sets of orthogonal hypercubes of class \(r\)2011-12-23Paper
Counting words by number of occurrences of some patterns2011-07-29Paper
https://portal.mardi4nfdi.de/entity/Q30622772011-01-03Paper
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms2010-12-03Paper
Codes with girth 8 Tanner graph representation2010-09-16Paper
https://portal.mardi4nfdi.de/entity/Q35767782010-08-02Paper
https://portal.mardi4nfdi.de/entity/Q35754832010-07-27Paper
The number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant terms2010-04-27Paper
Ambiguity and Deficiency in Costas Arrays and APN Permutations2010-04-27Paper
Division of trinomials by pentanomials over \(\mathbb F_ 2\) and orthogonal arrays2009-05-22Paper
The trace of an optimal normal element and low complexity normal bases2009-03-31Paper
Efficient \(p\)th root computations in finite fields of characteristic \(p\)2009-03-31Paper
Low-Density Parity-Check Lattices: Construction and Decoding Analysis2008-12-21Paper
Linear transformation shift registers2008-12-21Paper
Low Complexity Normal Elements over Finite Fields of Characteristic Two2008-09-10Paper
Algorithms to Locate Errors Using Covering Arrays2008-04-15Paper
Division of trinomials by pentanomials and orthogonal arrays2007-09-20Paper
A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics2007-03-12Paper
Sequences of consecutive smooth polynomials over a finite field2007-03-07Paper
Asymptotics of largest components in combinatorial structures2007-02-14Paper
Degree distribution of the greatest common divisor of polynomials over 𝔽q2006-09-06Paper
The number of permutation binomials over \({\mathbb F}_{4p+1}\) where \(p\) and \(4p+1\) are primes2006-08-30Paper
Low density parity check lattices based on construction \(D'\) and cycle-free Tanner graphs2006-03-09Paper
Distribution of exponential functions with \(k\)-full exponent modulo a prime2005-08-05Paper
Polynomial Gauss sums2005-04-27Paper
The degree of the splitting field of a random polynomial over a finite field2005-04-25Paper
https://portal.mardi4nfdi.de/entity/Q48322802005-01-04Paper
https://portal.mardi4nfdi.de/entity/Q48322772005-01-04Paper
Asymptotics of combinatorial structures with large smallest component2004-08-06Paper
Low complexity normal bases in \(\mathbb F_{2^n}\)2004-01-19Paper
https://portal.mardi4nfdi.de/entity/Q44289172003-09-22Paper
Polynomials over finite fields free from large and small degree irreducible factors2003-03-23Paper
Analysis of Rabin's irreducibility test for polynomials over finite fields2003-02-25Paper
Algorithms for exponentiation in finite fields2002-11-12Paper
Asymptotics of subtracted singularities for generating functions with small singularities2002-08-22Paper
A rigorous proof of the Waterloo algorithm for the discrete logarithm problem2002-08-21Paper
The complete analysis of a polynomial factorization algorithm over finite fields2001-11-29Paper
Factoring polynomials over finite fields: A survey2001-09-20Paper
Smallest components in decomposable structures: Exp-log class2001-09-18Paper
The index calculus method using non-smooth polynomials2001-05-14Paper
Exact largest and smallest size of components2001-01-01Paper
Analysis of Ben-Or's polynomial irreducibility test1999-12-19Paper
Density of normal elements1999-10-04Paper
https://portal.mardi4nfdi.de/entity/Q42178661999-08-16Paper
https://portal.mardi4nfdi.de/entity/Q38401651999-03-07Paper
https://portal.mardi4nfdi.de/entity/Q38389961999-02-25Paper
https://portal.mardi4nfdi.de/entity/Q42266941999-01-28Paper
https://portal.mardi4nfdi.de/entity/Q42266931999-01-28Paper
Gauss periods: orders and cryptographical applications1997-12-16Paper
https://portal.mardi4nfdi.de/entity/Q43361131997-12-08Paper

Research outcomes over time

This page was built for person: Daniel Panario