default search action
Philippe Langevin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Valérie Gillot, Philippe Langevin:
Covering radius of $ RM(4, 8) $. Adv. Math. Commun. 18(2): 383-393 (2024) - [i5]Valérie Gillot, Philippe Langevin, Alexandr Polujan:
On the normality of Boolean quartics. CoRR abs/2407.14038 (2024) - 2023
- [j15]Valérie Gillot, Philippe Langevin:
Classification of some cosets of the Reed-Muller code. Cryptogr. Commun. 15(6): 1129-1137 (2023) - 2022
- [i4]Valérie Gillot, Philippe Langevin:
Classification of Boolean functions. CoRR abs/2208.02469 (2022) - 2020
- [j14]Faruk Göloglu
, Philippe Langevin:
Almost perfect nonlinear families which are not equivalent to permutations. Finite Fields Their Appl. 67: 101707 (2020)
2010 – 2019
- 2019
- [j13]Pascale Charpin, Philippe Langevin:
Obituary of Jacques Wolfmann (1932-2018). Des. Codes Cryptogr. 87(5): 955-956 (2019) - 2016
- [j12]Daniel J. Katz, Philippe Langevin:
New open problems related to old conjectures by Helleseth. Cryptogr. Commun. 8(2): 175-189 (2016) - 2014
- [i3]Daniel J. Katz, Philippe Langevin:
Proof of a Conjectured Three-Valued Family of Weil Sums of Binomials. CoRR abs/1409.2459 (2014) - [i2]Daniel J. Katz, Philippe Langevin:
New Open Problems Related to Old Conjectures by Helleseth. CoRR abs/1412.8530 (2014) - 2013
- [c6]Yves Aubry, Philippe Langevin:
On a Conjecture of Helleseth. CAI 2013: 113-118 - [i1]Yves Aubry, Daniel J. Katz, Philippe Langevin:
Cyclotomy of Weil Sums of Binomials. CoRR abs/1312.3889 (2013) - 2011
- [j11]Yves Aubry
Guest editorial for the special issue for Jacques Wolfmann. Cryptogr. Commun. 3(4): 187-188 (2011) - [j10]Philippe Langevin, Gregor Leander
Counting all bent functions in dimension eight 99270589265934370305785861242880. Des. Codes Cryptogr. 59(1-3): 193-205 (2011) - [j9]Philippe Langevin, Xiang-dong Hou:
Counting Partial Spread Functions in Eight Variables. IEEE Trans. Inf. Theory 57(4): 2263-2269 (2011) - 2010
- [c5]Emrah Çakçak, Philippe Langevin:
Power Permutations in Dimension 32. SETA 2010: 181-187
2000 – 2009
- 2008
- [j8]Philippe Langevin, Gregor Leander
Monomial bent functions and Stickelberger's theorem. Finite Fields Their Appl. 14(3): 727-742 (2008) - 2007
- [j7]Philippe Langevin, Gregor Leander
A Counterexample to a Conjecture of Niho. IEEE Trans. Inf. Theory 53(12): 4785-4786 (2007) - 2005
- [j6]Philippe Langevin, Jean-Pierre Zanotti:
Nonlinearity of Some Invariant Boolean Functions. Des. Codes Cryptogr. 36(2): 131-146 (2005) - [j5]Philippe Langevin, Pascal Véron
On the Non-linearity of Power Functions. Des. Codes Cryptogr. 37(1): 31-43 (2005) - [c4]Yves Aubry
On the Weights of Binary Irreducible Cyclic Codes. WCC 2005: 46-54 - 2003
- [c3]Eric Brier, Philippe Langevin:
Classification of Boolean cubic forms of nine variables. ITW 2003: 179-182
1990 – 1999
- 1998
- [j4]Philippe Langevin:
Weights of Abelian Codes. Des. Codes Cryptogr. 14(3): 239-245 (1998) - 1997
- [j3]Xiang-dong Hou, Philippe Langevin:
Results on Bent Functions. J. Comb. Theory A 80(2): 232-246 (1997) - 1995
- [j2]Philippe Langevin, Jean-Pierre Zanotti:
Linear codes with balanced weight distribution. Appl. Algebra Eng. Commun. Comput. 6(4/5): 299-307 (1995) - 1993
- [j1]Philippe Langevin:
Almost Perfect Binary Functions. Appl. Algebra Eng. Commun. Comput. 4: 95-102 (1993) - 1991
- [c2]Philippe Langevin:
On the Orphans and Covering Radius of the Reed-Muller Codes. AAECC 1991: 234-240 - 1990
- [c1]Philippe Langevin:
Covering radius of RM (1, 9) in RM (3, 9). EUROCODE 1990: 51-59
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-08-23 18:30 CEST 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: