default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilfried Meidl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Wilfried Meidl:
Generalized bent functions with large dimension. Adv. Math. Commun. 18(5): 1514-1530 (2024)- [j73]Ayça Çesmelioglu, Wilfried Meidl:
Equivalence for generalized Boolean functions. Adv. Math. Commun. 18(6): 1590-1604 (2024) - [j72]Nurdagül Anbar
, Tekgül Kalayci, Wilfried Meidl:
Amorphic association schemes from bent partitions. Discret. Math. 347(1): 113658 (2024) - [j71]Sezel Alkan, Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Bent Partitions and LP-Packings. IEEE Trans. Inf. Theory 70(7): 5365-5375 (2024) - [i13]Nurdagül Anbar, Sadmir Kudin, Wilfried Meidl, Enes Pasalic, Alexandr Polujan:
Vectorial Negabent Concepts: Similarities, Differences, and Generalizations. CoRR abs/2402.05677 (2024) - 2023
- [j70]Lilya Budaghyan, Claude Carlet, Tor Helleseth, Wilfried Meidl:
Editorial: Special issue on Boolean functions and their applications 2022. Cryptogr. Commun. 15(6): 1049-1051 (2023) - [j69]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
On generalized spread bent partitions. Cryptogr. Commun. 15(6): 1217-1234 (2023) - [j68]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Generalized semifield spreads. Des. Codes Cryptogr. 91(2): 545-562 (2023) - [j67]Wilfried Meidl, Alexandr A. Polujan, Alexander Pott:
Linear codes and incidence structures of bent functions and their generalizations. Discret. Math. 346(1): 113157 (2023) - 2022
- [j66]Wilfried Meidl:
A survey on p-ary and generalized bent functions. Cryptogr. Commun. 14(4): 737-782 (2022) - [j65]Nurdagül Anbar, Wilfried Meidl:
Bent partitions. Des. Codes Cryptogr. 90(4): 1081-1101 (2022) - [j64]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai:
On a Class of Functions With the Maximal Number of Bent Components. IEEE Trans. Inf. Theory 68(9): 6174-6186 (2022) - [j63]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Bent Partitions and Partial Difference Sets. IEEE Trans. Inf. Theory 68(10): 6894-6903 (2022) - [i12]Nurdagül Anbar, Tekgül Kalyci, Wilfried Meidl, Constanza Riera, Pantelimon Stanica:
P℘N functions, complete mappings and quasigroup difference sets. CoRR abs/2212.12943 (2022) - 2021
- [j62]Wilfried Meidl, Isabel Pirsic:
Bent and ${{\mathbb {Z}}}_{2^k}$-Bent functions from spread-like partitions. Des. Codes Cryptogr. 89(1): 75-89 (2021) - [j61]Ayça Çesmelioglu, Wilfried Meidl, Isabel Pirsic:
Vectorial bent functions and partial difference sets. Des. Codes Cryptogr. 89(10): 2313-2330 (2021) - [j60]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Analysis of (n, n)-Functions Obtained From the Maiorana-McFarland Class. IEEE Trans. Inf. Theory 67(7): 4891-4901 (2021) - 2020
- [j59]Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott:
Vectorial bent functions in odd characteristic and their components. Cryptogr. Commun. 12(5): 899-912 (2020) - [j58]Nurdagül Anbar, Canan Kasikci, Wilfried Meidl, Alev Topuzoglu:
Shifted plateaued functions and their differential properties. Cryptogr. Commun. 12(6): 1091-1105 (2020) - [j57]Shuxing Li, Wilfried Meidl, Alexandr Polujan, Alexander Pott, Constanza Riera, Pantelimon Stanica:
Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application. IEEE Trans. Inf. Theory 66(11): 7101-7112 (2020) - [i11]Shuxing Li, Wilfried Meidl, Alexandr Polujan, Alexander Pott, Constanza Riera, Pantelimon Stanica:
Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application. CoRR abs/2006.01941 (2020) - [i10]Wilfried Meidl, Isabel Pirsic:
Bent and Z2k-bent functions from spread-like partitions. CoRR abs/2009.11019 (2020) - [i9]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai:
On functions with the maximal number of bent components. CoRR abs/2010.03801 (2020) - [i8]Wilfried Meidl, Alexandr A. Polujan, Alexander Pott:
Linear codes and incidence structures of bent functions and their generalizations. CoRR abs/2012.06866 (2020)
2010 – 2019
- 2019
- [j56]Wilfried Meidl, Alexander Pott:
Generalized bent functions into ℤ p k $\mathbb {Z}_{p^{k}}$ from the partial spread and the Maiorana-McFarland class. Cryptogr. Commun. 11(6): 1233-1245 (2019) - [j55]Nurdagül Anbar, Wilfried Meidl, Alexander Pott:
Equivalence for negabent functions and their relative difference sets. Discret. Appl. Math. 270: 1-12 (2019) - [j54]Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Determining the Walsh spectra of Taniguchi's and related APN-functions. Finite Fields Their Appl. 60 (2019) - 2018
- [j53]Ayça Çesmelioglu, Wilfried Meidl:
Bent and vectorial bent functions, partial difference sets, and strongly regular graphs. Adv. Math. Commun. 12(4): 691-705 (2018) - [j52]Nurdagül Anbar, Wilfried Meidl:
Modified planar functions and their components. Cryptogr. Commun. 10(2): 235-249 (2018) - [j51]Wilfried Meidl, Isabel Pirsic:
On the normality of p-ary bent functions. Cryptogr. Commun. 10(6): 1037-1049 (2018) - [j50]Wilfried Meidl:
A secondary construction of bent functions, octal gbent functions and their duals. Math. Comput. Simul. 143: 57-64 (2018) - [j49]Samir Hodzic, Wilfried Meidl, Enes Pasalic:
Full Characterization of Generalized Bent Functions as (Semi)-Bent Spaces, Their Dual, and the Gray Image. IEEE Trans. Inf. Theory 64(7): 5432-5440 (2018) - [c7]Thor Martinsen, Wilfried Meidl, Alexander Pott, Pantelimon Stanica:
On Symmetry and Differential Properties of Generalized Boolean Functions. WAIFI 2018: 207-223 - 2017
- [j48]Nurdagül Anbar, Wilfried Meidl, Alev Topuzoglu:
Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension. Des. Codes Cryptogr. 82(1-2): 265-291 (2017) - [j47]Thor Martinsen, Wilfried Meidl, Pantelimon Stanica:
Partial spread and vectorial generalized bent functions. Des. Codes Cryptogr. 85(1): 1-13 (2017) - [j46]Nurdagül Anbar, Wilfried Meidl:
Bent and bent4 spectra of Boolean functions over finite fields. Finite Fields Their Appl. 46: 163-178 (2017) - [j45]Thor Martinsen, Wilfried Meidl, Sihem Mesnager, Pantelimon Stanica:
Decomposing Generalized Bent and Hyperbent Functions. IEEE Trans. Inf. Theory 63(12): 7804-7812 (2017) - 2016
- [j44]Canan Kasikci, Wilfried Meidl, Alev Topuzoglu:
Spectra of a class of quadratic functions: Average behaviour and counting functions. Cryptogr. Commun. 8(2): 191-214 (2016) - [j43]Wilfried Meidl, Harald Niederreiter:
Multisequences with high joint nonlinear complexity. Des. Codes Cryptogr. 81(2): 337-346 (2016) - [j42]Wilfried Meidl:
Generalized Rothaus construction and non-weakly regular bent functions. J. Comb. Theory A 141: 78-89 (2016) - [j41]Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott:
There Are Infinitely Many Bent Functions for Which the Dual Is Not Bent. IEEE Trans. Inf. Theory 62(9): 5204-5208 (2016) - [c6]Thor Martinsen, Wilfried Meidl, Pantelimon Stanica:
Generalized Bent Functions and Their Gray Images. WAIFI 2016: 160-173 - [i7]Thor Martinsen, Wilfried Meidl, Sihem Mesnager, Pantelimon Stanica:
Decomposing generalized bent and hyperbent functions. CoRR abs/1604.02830 (2016) - [i6]Samir Hodzic, Wilfried Meidl, Enes Pasalic:
Full characterization of generalized bent functions as (semi)-bent spaces, their dual, and the Gray image. CoRR abs/1605.05713 (2016) - 2015
- [j40]Nurdagül Anbar, Wilfried Meidl:
More on quadratic functions and maximal Artin-Schreier curves. Appl. Algebra Eng. Commun. Comput. 26(5): 409-426 (2015) - [j39]Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott:
Bent Functions, Spreads, and o-Polynomials. SIAM J. Discret. Math. 29(2): 854-867 (2015) - [i5]Thor Martinsen, Wilfried Meidl, Pantelimon Stanica:
Generalized bent functions and their Gray images. CoRR abs/1511.01438 (2015) - [i4]Thor Martinsen, Wilfried Meidl, Pantelimon Stanica:
Partial Spread and Vectorial Generalized Bent Functions. CoRR abs/1511.01705 (2015) - [i3]Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott:
There are infinitely many bent functions for which the dual is not bent. CoRR abs/1511.02505 (2015) - 2014
- [j38]Nurdagül Anbar, Wilfried Meidl:
Quadratic functions and maximal Artin-Schreier curves. Finite Fields Their Appl. 30: 49-71 (2014) - [j37]Ayça Çesmelioglu, Wilfried Meidl, Alev Topuzoglu:
Permutations of finite fields with prescribed properties. J. Comput. Appl. Math. 259: 536-545 (2014) - [j36]Wilfried Meidl, Sankhadip Roy, Alev Topuzoglu:
Enumeration of Quadratic Functions With Prescribed Walsh Spectrum. IEEE Trans. Inf. Theory 60(10): 6669-6680 (2014) - [p2]Ayça Çesmelioglu, Wilfried Meidl, Alev Topuzoglu:
Partially bent functions and their properties. Applied Algebra and Number Theory 2014: 22-38 - [i2]Wilfried Meidl, Harald Niederreiter:
Multisequences with high joint nonlinear complexity. CoRR abs/1411.2348 (2014) - 2013
- [j35]Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott:
On the dual of (non)-weakly regular bent functions and self-dual bent functions. Adv. Math. Commun. 7(4): 425-440 (2013) - [j34]Ayça Çesmelioglu, Wilfried Meidl:
A construction of bent functions from plateaued functions. Des. Codes Cryptogr. 66(1-3): 231-242 (2013) - [j33]Wilfried Meidl, Alev Topuzoglu:
Quadratic functions with prescribed spectra. Des. Codes Cryptogr. 66(1-3): 257-273 (2013) - [j32]Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott:
Generalized Maiorana-McFarland class and normality of p-ary bent functions. Finite Fields Their Appl. 24: 105-117 (2013) - [j31]Nina Brandstätter, Wilfried Meidl, Arne Winterhof:
Addendum to Sidel'nikov sequences over nonprime fields. Inf. Process. Lett. 113(9): 332-336 (2013) - [p1]Wilfried Meidl, Arne Winterhof:
Linear complexity of sequences and multisequences. Handbook of Finite Fields 2013: 324-336 - 2012
- [j30]Ayça Çesmelioglu, Gary McGuire, Wilfried Meidl:
A construction of weakly and non-weakly regular bent functions. J. Comb. Theory A 119(2): 420-429 (2012) - [j29]Ayça Çesmelioglu, Wilfried Meidl:
Bent Functions of Maximal Degree. IEEE Trans. Inf. Theory 58(2): 1186-1190 (2012) - 2010
- [c5]Ayça Çesmelioglu, Wilfried Meidl:
A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets. SETA 2010: 125-138 - [i1]Ayça Çesmelioglu, Gary McGuire, Wilfried Meidl:
A Construction of Weakly and Non-Weakly Regular Bent Functions. CoRR abs/1011.6242 (2010)
2000 – 2009
- 2009
- [j28]Wilfried Meidl:
How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences. Cryptogr. Commun. 1(1): 117-133 (2009) - [j27]Wilfried Meidl:
Remarks on a cyclotomic sequence. Des. Codes Cryptogr. 51(1): 33-43 (2009) - [j26]Wilfried Meidl, Ferruh Özbudak:
Linear complexity over Fq and over Fqm for linear recurring sequences. Finite Fields Their Appl. 15(1): 110-124 (2009) - [j25]Esen Aksoy, Ayça Çesmelioglu, Wilfried Meidl, Alev Topuzoglu:
On the Carlitz rank of permutation polynomials. Finite Fields Their Appl. 15(4): 428-440 (2009) - 2008
- [j24]Wilfried Meidl:
Reducing the calculation of the linear complexity of u 2 v -periodic binary sequences to Games-Chan algorithm. Des. Codes Cryptogr. 46(1): 57-65 (2008) - [j23]Ayça Çesmelioglu, Wilfried Meidl, Alev Topuzoglu:
On the cycle structure of permutation polynomials. Finite Fields Their Appl. 14(3): 593-614 (2008) - [j22]Nina Brandstätter, Wilfried Meidl:
On the linear complexity of Sidel'nikov sequences over nonprime fields. J. Complex. 24(5-6): 648-659 (2008) - [c4]Wilfried Meidl, Ferruh Özbudak:
Generalized Joint Linear Complexity of Linear Recurring Multisequences. SETA 2008: 266-277 - 2007
- [j21]Wilfried Meidl, Ayineedi Venkateswarlu:
Remarks on the k-error linear complexity of pn-periodic sequences. Des. Codes Cryptogr. 42(2): 181-193 (2007) - [j20]Wilfried Meidl, Arne Winterhof:
On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions. Finite Fields Their Appl. 13(3): 628-634 (2007) - [j19]Wilfried Meidl, Harald Niederreiter, Ayineedi Venkateswarlu:
Error linear complexity measures for multisequences. J. Complex. 23(2): 169-192 (2007) - [j18]Hassan Aly, Wilfried Meidl, Arne Winterhof:
On the k-error linear complexity of cyclotomic sequences. J. Math. Cryptol. 1(3): 283-296 (2007) - [j17]Hassan Aly, Wilfried Meidl:
On the Linear Complexity and k-Error Linear Complexity Over BBFp of the d-ary Sidel'nikov Sequence. IEEE Trans. Inf. Theory 53(12): 4755-4761 (2007) - 2006
- [j16]Wilfried Meidl:
Continued fraction for formal laurent series and the lattice structure of sequences. Appl. Algebra Eng. Commun. Comput. 17(1): 29-39 (2006) - [j15]Wilfried Meidl, Arne Winterhof:
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences. Des. Codes Cryptogr. 38(2): 159-178 (2006) - [j14]Wilfried Meidl:
Enumeration results on linear complexity profiles and lattice profiles. J. Complex. 22(2): 275-286 (2006) - [c3]Nina Brandstätter, Wilfried Meidl:
On the Linear Complexity of Sidel'nikov Sequences over Fd. SETA 2006: 47-60 - 2005
- [j13]Wilfried Meidl, Arne Winterhof:
On the joint linear complexity profile of explicit inversive multisequences. J. Complex. 21(3): 324-336 (2005) - [j12]Wilfried Meidl:
On the stability of 2n-periodic binary sequences. IEEE Trans. Inf. Theory 51(3): 1151-1155 (2005) - 2004
- [j11]Wilfried Meidl:
How Many Bits have to be Changed to Decrease the Linear Complexity?. Des. Codes Cryptogr. 33(2): 109-122 (2004) - [j10]Gerhard Dorfer, Wilfried Meidl, Arne Winterhof:
Counting functions and expected values for the lattice profile at n. Finite Fields Their Appl. 10(4): 636-652 (2004) - [j9]Wilfried Meidl, Arne Winterhof:
On the linear complexity profile of some new explicit inversive pseudorandom numbers. J. Complex. 20(2-3): 350-355 (2004) - [c2]Wilfried Meidl:
Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences. SETA 2004: 101-112 - 2003
- [j8]Wilfried Meidl, Harald Niederreiter:
Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity. Appl. Algebra Eng. Commun. Comput. 14(4): 273-286 (2003) - [j7]Wilfried Meidl, Arne Winterhof:
On the linear complexity profile of explicit nonlinear pseudorandom numbers. Inf. Process. Lett. 85(1): 13-18 (2003) - [j6]Wilfried Meidl, Harald Niederreiter:
The expected value of the joint linear complexity of periodic multisequences. J. Complex. 19(1): 61-72 (2003) - [j5]Wilfried Meidl:
Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. Theor. Comput. Sci. 290(3): 2045-2051 (2003) - [c1]Wilfried Meidl, Arne Winterhof:
On the Autocorrelation of Cyclotomic Generators. International Conference on Finite Fields and Applications 2003: 1-11 - 2002
- [j4]Wilfried Meidl, Arne Winterhof:
A Polynomial Representation of the Diffie-Hellman Mapping. Appl. Algebra Eng. Commun. Comput. 13(4): 313-318 (2002) - [j3]Wilfried Meidl, Harald Niederreiter:
Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform. J. Complex. 18(1): 87-103 (2002) - [j2]Wilfried Meidl, Harald Niederreiter:
On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences. IEEE Trans. Inf. Theory 48(11): 2817-2825 (2002) - 2001
- [j1]Wilfried Meidl, Arne Winterhof:
Lower bounds on the linear complexity of the discrete logarithm in finite fields. IEEE Trans. Inf. Theory 47(7): 2807-2811 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
