Daniel Panario

Lucas Reis

Finite Fields Their Appl., 2025

Quasi-polycyclic and skew quasi-polycyclic codes over Fq.

[BibT_eX]

[DOI]

Tushar Bag

Finite Fields Their Appl., 2025

2024

Additive codes with few weights.

[BibT_eX]

[DOI]

Murat Sahin

Cryptogr. Commun., September, 2024

Girth Analysis of Quantum Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., June, 2024

Probabilistic root finding in code-based cryptography.

[BibT_eX]

[DOI]

J. Cryptogr. Eng., April, 2024

Construction of Protograph-Based LDPC Codes With Chordless Short Cycles.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, January, 2024

Linear label code of a root lattice using Gröbner bases.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., January, 2024

Nilpotent linearized polynomials over finite fields, revisited.

[BibT_eX]

[DOI]

Lucas Reis

Finite Fields Their Appl., 2024

The complexity of elliptic normal bases.

[BibT_eX]

[DOI]

Mohamadou Sall

CoRR, 2024

A Concrete LIP-Based KEM With Simple Lattices.

[BibT_eX]

[DOI]

Gustavo de Castro Biage

Gustavo Zambonin

Thaís Bardini Idalino

IEEE Access, 2024

Disjoint Difference Sets and QC-LDPC Codes With Girth 10.

[BibT_eX]

[DOI]

Proceedings of the 12th Iran Workshop on Communication and Information Theory, 2024

2023

One-generator quasi-cyclic codes and their dual codes.

[BibT_eX]

[DOI]

Kanat Abdukhalikov

Tushar Bag

Discret. Math., June, 2023

Comparing balanced sequences obtained from ElGamal function to random balanced sequences.

[BibT_eX]

[DOI]

Lucas Pandolfo Perin

Cryptogr. Commun., May, 2023

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}]$.

[BibT_eX]

[DOI]

Ashish Kumar Upadhyay

Cryptogr. Commun., May, 2023

2022

QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2022

Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces.

[BibT_eX]

[DOI]

André Guerino Castoldi

Emerson L. Monte Carmelo

CoRR, 2022

Equivalence Classes and Balance Properties of Interleaved Sequences.

[BibT_eX]

[DOI]

Kirsten Nelson

Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022

Trade-Based LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Maximum-Length Low-Density MDS Codes and Near Resolvable Designs.

[BibT_eX]

[DOI]

Odae Al Aboud

Proceedings of the IEEE International Symposium on Information Theory, 2022

Protograph-based LDPC codes with chordless short cycles and large minimum distance.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Workshop on Information Theory, 2022

2021

Secure one-way relaying scheme based on random difference family (RDF) lattice codes.

[BibT_eX]

[DOI]

Wirel. Networks, 2021

Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Improved constant-sum encodings for hash-based signatures.

[BibT_eX]

[DOI]

Lucas Pandolfo Perin

Gustavo Zambonin

J. Cryptogr. Eng., 2021

Comparing balanced Zv-sequences obtained from ElGamal function to random balanced sequences.

[BibT_eX]

[DOI]

Lucas Pandolfo Perin

CoRR, 2021

Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

The Design of a Novel Multiple-Parameter Fractional Number-Theoretic Transform and Its Application to Image Encryption.

[BibT_eX]

[DOI]

José R. de Oliveira-Neto

IEEE Trans. Circuits Syst. Video Technol., 2020

A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes.

[BibT_eX]

[DOI]

Taraneh Eghlidos

IEEE Trans. Commun., 2020

Periods of Iterations of Functions with Restricted Preimage Sizes.

[BibT_eX]

[DOI]

Rodrigo S. V. Martins

Eric Schmutz

ACM Trans. Algorithms, 2020

Finding linearly generated subsequences.

[BibT_eX]

[DOI]

CoRR, 2020

A construction of 픽2-linear cyclic, MDS codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2020

QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2020

A trigonometric approach for Dickson polynomials over fields of characteristic two.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2020

Finding Linearly Generated Subsequences.

[BibT_eX]

[DOI]

Bastien Rigault

Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019

A General Construction of Ordered Orthogonal Arrays Using LFSRs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

A new class of irreducible pentanomials for polynomial-based multipliers in binary fields.

[BibT_eX]

[DOI]

Gustavo Banegas

J. Cryptogr. Eng., 2019

The graph structure of Chebyshev polynomials over finite fields and applications.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

The functional graph of linear maps over finite fields and applications.

[BibT_eX]

[DOI]

Lucas Reis

Des. Codes Cryptogr., 2019

Squeezing a vectorial nonlinear binary transformation between two perpendicular matrices.

[BibT_eX]

[DOI]

CoRR, 2019

A Lattice Based Joint Encryption, Encoding and Modulation Scheme.

[BibT_eX]

[DOI]

Taraneh Eghlidos

CoRR, 2019

Unicyclic strong permutations.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

Fixed points of rational functions satisfying the Carlitz property.

[BibT_eX]

[DOI]

Kaitlyn Chubb

Emerson Luiz do Monte Carmelo

Appl. Algebra Eng. Commun. Comput., 2019

Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays.

[BibT_eX]

[DOI]

André Guerino Castoldi

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2018

A generating matrix method for constructing Hermite-Gaussian-like number-theoretic transform eigenvectors.

[BibT_eX]

[DOI]

José R. de Oliveira-Neto

Signal Process., 2018

Fast modular reduction and squaring in GF(2m).

[BibT_eX]

[DOI]

Lucas Boppre Niehues

Inf. Process. Lett., 2018

Number of t-tuples in arrays from LFSRs.

[BibT_eX]

[DOI]

Georgios Tzanakis

Electron. Notes Discret. Math., 2018

A non-commutative cryptosystem based on quaternion algebras.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

Nonlinear vectorial primitive recursive sequences.

[BibT_eX]

[DOI]

Sartaj Ul Hasan

Cryptogr. Commun., 2018

Normal Basis Exhaustive Search: 10 Years Later.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

A Neural Network Lattice Decoding Algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security.

[BibT_eX]

[DOI]

Martín A. Gagliotti Vigil

Proceedings of the 15th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, 2018

Secret Sharing Schemes with Hidden Sets.

[BibT_eX]

[DOI]

Rick Lopes de Souza

Florian Caullery

Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018

A Family of Matrices for Generating Hermite-Gaussian-Like DFT Eigenvectors.

[BibT_eX]

[DOI]

José R. de Oliveira-Neto

Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes.

[BibT_eX]

[DOI]

Rodrigo S. V. Martins

Eric Schmutz

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Ordered Orthogonal Array Construction Using LFSR Sequences.

[BibT_eX]

[DOI]

André Guerino Castoldi

IEEE Trans. Inf. Theory, 2017

Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields.

[BibT_eX]

[DOI]

Daniel Santana

Finite Fields Their Appl., 2017

Covering arrays from m-sequences and character sums.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Cycle structure of iterating Redei functions.

[BibT_eX]

[DOI]

Rodrigo S. V. Martins

Adv. Math. Commun., 2017

2016

Fast and Simple Modular Interpolation Using Factorial Representation.

[BibT_eX]

[DOI]

Am. Math. Mon., 2016

Constructing new covering arrays from LFSR sequences over finite fields.

[BibT_eX]

[DOI]

Discret. Math., 2016

Finite field constructions of combinatorial arrays.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

Construction of Full-Diversity LDPC Lattices for Block-Fading Channels.

[BibT_eX]

[DOI]

Ismara Álvarez-Barrientos

CoRR, 2016

Computing Gröbner bases associated with lattices.

[BibT_eX]

[DOI]

Mijail Borges-Quintana

Miguel Angel Borges-Trenard

Adv. Math. Commun., 2016

Construction of full-diversity 1-level LDPC lattices for block-fading channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

A secret key encryption scheme based on 1-level QC-LDPC lattices.

[BibT_eX]

[DOI]

Taraneh Eghlidos

Proceedings of the 13th International Iranian Society of Cryptology Conference on Information Security and Cryptology, 2016

2015

Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Locating modifications in signed data for partial data integrity.

[BibT_eX]

[DOI]

Thaís Bardini Idalino

Inf. Process. Lett., 2015

An asymptotic formula for the number of irreducible transformation shift registers.

[BibT_eX]

[DOI]

CoRR, 2015

Linear complexity profile and correlation measure of interleaved sequences.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2015

Binomial ideal associated to a lattice and its label code.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

A Johnson-type bound for group codes and lattices.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

2014

The rth Smallest Part Size of a Random Integer Partition.

[BibT_eX]

[DOI]

Integers, 2014

General conditional recurrences.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

Open Problems for Polynomials over Finite Fields and Applications.

[BibT_eX]

[DOI]

Proceedings of the Open Problems in Mathematics and Computational Science, 2014

A trigonometric approach for Chebyshev polynomials over finite fields.

[BibT_eX]

[DOI]

Ricardo M. Campello de Souza

Proceedings of the Applied Algebra and Number Theory, 2014

2013

Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Grobner Bases for Lattices and an Algebraic Decoding Algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2013

A Family of Fibonacci-Like Conditional Sequences.

[BibT_eX]

[DOI]

Murat Sahin

Integers, 2013

Existence and properties of k-normal elements over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2013

Univariate polynomial counting and algorithms.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

Conditions for reducible polynomials.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

Introduction to primitive polynomials.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

Introduction to finite fields : Basic properties of finite fields.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

2012

In honour of the research and influence of Joachim von zur Gathen at 60.

[BibT_eX]

[DOI]

Mark Giesbrecht

J. Symb. Comput., 2012

Sets of orthogonal hypercubes of class r.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields.

[BibT_eX]

[DOI]

Georgios Tzanakis

Finite Fields Their Appl., 2012

Divisibility of polynomials over finite fields and combinatorial applications.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

Gauss periods as constructions of low complexity normal bases.

[BibT_eX]

[DOI]

Maria Christopoulou

Des. Codes Cryptogr., 2012

Generalized Alcuin's Sequence.

[BibT_eX]

[DOI]

Murat Sahin

Electron. J. Comb., 2012

Cycle structure of permutation functions over finite fields and their applications.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2012

Interval Partitions and Polynomial Factorization.

[BibT_eX]

[DOI]

Algorithmica, 2012

Word-Oriented Transformation Shift Registers and Their Linear Complexity.

[BibT_eX]

[DOI]

Sartaj Ul Hasan

Proceedings of the Sequences and Their Applications - SETA 2012, 2012

Random Mappings with Restricted Preimages.

[BibT_eX]

[DOI]

Andrew MacFie

Proceedings of the Progress in Cryptology - LATINCRYPT 2012, 2012

2011

Two New Measures for Permutations: Ambiguity and Deficiency.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Swan-like results for binomials and trinomials over finite fields of odd characteristic.

[BibT_eX]

[DOI]

Brandon Hanson

Des. Codes Cryptogr., 2011

Turbo Lattices: Construction and Performance Analysis

[BibT_eX]

[DOI]

CoRR, 2011

Counting Words by Number of Occurrences of Some Patterns.

[BibT_eX]

[DOI]

Zhicheng Gao

Andrew MacFie

Electron. J. Comb., 2011

Ambiguity and deficiency of permutations from finite fields.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p.

[BibT_eX]

[DOI]

Asie Abolpour

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010

A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2010

Adaptive sampling strategies for quickselects.

[BibT_eX]

[DOI]

Conrado Martínez

Alfredo Viola

ACM Trans. Algorithms, 2010

Public-key encryption based on Chebyshev polynomials over GF(q).

[BibT_eX]

[DOI]

Ricardo M. Campello de Souza

Inf. Process. Lett., 2010

Asymptotics of smallest component sizes in decomposable structures of alg-log type.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

The number of irreducible polynomials of degree n over Fq with given trace and constant terms.

[BibT_eX]

[DOI]

B. Omidi Koma

Discret. Math., 2010

Codes with girth 8 Tanner graph representation.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

Self-Inverse Interleavers for Turbo Codes

[BibT_eX]

[DOI]

Nasim Eshghi

CoRR, 2010

Ambiguity and Deficiency in Costas Arrays and APN Permutations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Bivariate Asymptotics for Striped Plane Partitions.

[BibT_eX]

[DOI]

Benjamin Young

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

Construction of turbo lattices.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

Self-inverse interleavers based on permutation functions for turbo codes.

[BibT_eX]

[DOI]

Nasim Eshghi

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Efficient p th root computations in finite fields of characteristic p.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

2008

Low Complexity Normal Elements over Finite Fields of Characteristic Two.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2008

The trace of an optimal normal element and low complexity normal bases.

[BibT_eX]

[DOI]

Maria Christopoulou

Des. Codes Cryptogr., 2008

Algorithms to Locate Errors Using Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Security of public-key cryptosystems based on Chebyshev polynomials over prime finite fields.

[BibT_eX]

[DOI]

Ricardo M. Campello de Souza

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Division of trinomials by pentanomials and orthogonal arrays.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2007

2006

Low-Density Parity-Check Lattices: Construction and Decoding Analysis.

[BibT_eX]

[DOI]

Amir H. Banihashemi

IEEE Trans. Inf. Theory, 2006

Degree distribution of the greatest common divisor of polynomials over Fq.

[BibT_eX]

[DOI]

Zhicheng Gao

Random Struct. Algorithms, 2006

The Number of Permutation Binomials over F4p+1 where p and 4p+1 are Primes.

[BibT_eX]

[DOI]

Ariane M. Masuda

Electron. J. Comb., 2006

A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Asymptotics of Largest Components in Combinatorial Structures.

[BibT_eX]

[DOI]

Algorithmica, 2006

Preface.

[BibT_eX]

[DOI]

Philippe Jacquet

Wojciech Szpankowski

Algorithmica, 2006

2005

Flexible tree-search based orthogonal matching pursuit algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

2004

Asymptotics of combinatorial structures with large smallest component.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2004

Low complexity normal bases in F22.

[BibT_eX]

[DOI]

Benjamin Young

Finite Fields Their Appl., 2004

The Degree of the Splitting Field of a Random Polynomial over a Finite Field.

[BibT_eX]

[DOI]

John D. Dixon

Electron. J. Comb., 2004

Adaptive sampling for quickselect.

[BibT_eX]

[DOI]

Conrado Martinez

Alfredo Viola

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Integer to integer Karhunen Loeve transform over finite fields [communication system applications].

[BibT_eX]

[DOI]

Günes Karabulut

Abbas Yongaçoglu

Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

A Simple Primality Test and th rth Smallest Prime Factor.

[BibT_eX]

Martha Yip

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Linear transformation shift registers.

[BibT_eX]

[DOI]

Michael Dewar

IEEE Trans. Inf. Theory, 2003

What Do Random Polynomials over Finite Fields Look Like?

[BibT_eX]

[DOI]

Proceedings of the Finite Fields and Applications, 2003

Mutual Irreducibility of Certain Polynomials.

[BibT_eX]

[DOI]

Michael Dewar

Proceedings of the Finite Fields and Applications, 2003

Low density parity check lattices based on construction D' and cycle-free Tanner graphs.

[BibT_eX]

Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002

Polynomials over finite fields free from large and small degree irreducible factors.

[BibT_eX]

[DOI]

J. Algorithms, 2002

A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem.

[BibT_eX]

Michael Drmota

Des. Codes Cryptogr., 2002

2001

Analysis of Rabin's irreducibility test for polynomials over finite fields.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

The index calculus method using non-smooth polynomials.

[BibT_eX]

[DOI]

Math. Comput., 2001

Factoring Polynomials Over Finite Fields: A Survey.

[BibT_eX]

[DOI]

J. Symb. Comput., 2001

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields.

[BibT_eX]

[DOI]

Philippe Flajolet

Xavier Gourdon

J. Algorithms, 2001

Exact Largest and Smallest Size of Components.

[BibT_eX]

[DOI]

Algorithmica, 2001

Smallest Components in Decomposable Structures: Exp-Log Class.

[BibT_eX]

[DOI]

Algorithmica, 2001

2000

Algorithms for Exponentiation in Finite Fields.

[BibT_eX]

[DOI]

Shuhong Gao

Victor Shoup

J. Symb. Comput., 2000

1998

Analysis of Ben-Or's polynomial irreducibility test.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

Gauss periods: orders and cryptographical applications.

[BibT_eX]

[DOI]

Shuhong Gao

Math. Comput., 1998

Analysis of Rabin's Polynomial Irreducability Test.

[BibT_eX]

[DOI]

Alfredo Viola

Proceedings of the LATIN '98: Theoretical Informatics, 1998

An Analytic Approach to Smooth Polynominals over Finite Fields.

[BibT_eX]

[DOI]

Xavier Gourdon

Philippe Flajolet

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997

Combinatorial and algebraic aspects of polynomials over finite fields.

[BibT_eX]

[DOI]

PhD thesis, 1997

1996

Random Polynomials and Polynomial Factorization.

[BibT_eX]

[DOI]

Philippe Flajolet

Xavier Gourdon

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).

[BibT_eX]

[DOI]

Shuhong Gao