Ana Sălăgean

Available identifiers

zbMath Open salagean.ana-mariaMaRDI QIDQ505071

List of research outcomes

Publication	Date of Publication	Type
Coset leaders of the first order Reed-Muller codes in the classes of Niho functions and threshold functions	2024-08-30	Paper
Probabilistic estimation of the algebraic degree of Boolean functions	2023-12-14	Paper
Further constructions and characterizations of generalized almost perfect nonlinear functions	2023-12-14	Paper
Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions	2022-04-25	Paper
New generalized almost perfect nonlinear functions	2021-02-19	Paper
Counting Boolean functions with faster points	2020-09-22	Paper
Discrete antiderivatives for functions over \(\mathbb{F}_p^n\)	2020-02-25	Paper
Higher order differentiation over finite fields with applications to generalising the cube attack	2017-09-28	Paper
An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations	2017-08-08	Paper
Apology for Citation Omission in “An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations” [Oct 09 4695-4700	2017-07-27	Paper
Counting and characterising functions with ``fast points for differential attacks	2017-01-19	Paper
Comparison of Cube Attacks Over Different Vector Spaces	2016-01-12	Paper
Efficient Generation of Elementary Sequences	2014-01-17	Paper
Computing the linear complexity for sequences with characteristic polynomial \(f^v\)	2013-08-02	Paper
Index Tables of Finite Fields and Modular Golomb Rulers	2012-09-07	Paper
On the Stability of m-Sequences	2011-12-16	Paper
One- and two-page crossing numbers for some types of graphs	2010-09-14	Paper
An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform	2010-09-08	Paper
On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two	2008-12-21	Paper
On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two	2008-03-14	Paper
Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences	2008-03-07	Paper
Parallelisation of genetic algorithms for the 2-page crossing number problem	2007-02-14	Paper
Repeated-root cyclic and negacyclic codes over a finite chain ring	2006-04-28	Paper
Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings	2005-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q4664095	2005-04-05	Paper
Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.	2003-05-04	Paper
On the key equation over a commutative ring	2003-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4945364	2002-03-18	Paper
Gröbner bases and products of coefficient rings	2002-01-01	Paper
Strong Gröbner bases and cyclic codes over a finite-chain ring	2001-10-14	Paper
Strong Gröbner bases for polynomials over a principal ideal ring.	2001-01-01	Paper
On the Hamming distance of linear codes over a finite chain ring	2000-09-07	Paper
On the structure of linear and cyclic codes over a finite chain ring	2000-08-08	Paper

Research outcomes over time

This page was built for person: Ana Sălăgean