( en | de | ru )

 

Disambiguation of "Panario, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Swan-like results for binomials and trinomials over finite fields of odd characteristic.

, , and . Des. Codes Cryptogr., 61 (3): 273-283 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel

Daniel

Daniel Stanze

Systematische Analyse von Rezeptoren und Effektormechanismen der pulmonalen angeborenen Immunität. Uni Marburg, (2009)

Daniel Wied

Zivilprozessuale Qualifikationsprobleme im Spannungsfeld von Vertrag und Delikt: ein Beitrag zur Auslegung nationalen Zivilprozessrechts in europäischer Perspektive. Uni Regensburg, (2009)

Daniel Dirkmann

In-vitro-Untersuchungen zum Effekt von Hypothermie und Azidose auf Variablen thrombelastometrischer Messungen der Blutgerinnung. Uni Duisburg-Essen, (2009)
 

Other publications of authors with the same name

Integer to integer Karhunen Loeve transform over finite fields communication system applications., , and . ICASSP (5), page 213-216. IEEE, (2004)A construction of 픽2-linear cyclic, MDS codes., , , and . Adv. Math. Commun., 14 (3): 437-453 (2020)Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length., , and . ISIT, page 368-373. IEEE, (2021)A secret key encryption scheme based on 1-level QC-LDPC lattices., , , and . ISCISC, page 20-25. IEEE, (2016)A Non-commutative Cryptosystem Based on Quaternion Algebras., , and . CoRR, (2017)A non-commutative cryptosystem based on quaternion algebras., , and . Des. Codes Cryptogr., 86 (10): 2345-2377 (2018)An Analytic Approach to Smooth Polynominals over Finite Fields., , and . ANTS, volume 1423 of Lecture Notes in Computer Science, page 226-236. Springer, (1998)Gröbner bases for lattices and an algebraic decoding algorithm., , and . Allerton, page 1414-1415. IEEE, (2011)Analysis of Rabin's Polynomial Irreducability Test., and . LATIN, volume 1380 of Lecture Notes in Computer Science, page 1-10. Springer, (1998)Additive codes with few weights., , and . Cryptogr. Commun., 16 (5): 1077-1102 (September 2024)