Zobrazeno 1 - 10
of 122
pro vyhledávání: '"Gérard D. Cohen"'
Publikováno v:
European Journal of Combinatorics. 80:71-81
Plateaued and bent functions play a significant role in cryptography, sequence theory, coding theory and combinatorics. In 1997, Coulter and Matthews redefined bent functions over any finite field F q where q is a prime power, and established their p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e75ed56ddc06bcbfc806d566caf1d6e5
https://doi.org/10.1016/j.ejc.2018.02.025
https://doi.org/10.1016/j.ejc.2018.02.025
Publikováno v:
Designs, Codes and Cryptography
Designs, Codes and Cryptography, Springer Verlag, 2019, ⟨10.1007/s10623-018-0488-z⟩
Designs, Codes and Cryptography, Springer Verlag, 2019, ⟨10.1007/s10623-018-0488-z⟩
We study the combinatorial function L(k, q), the maximum number of nonzero weights a linear code of dimension k over $${\mathbb {F}}_q$$ can have. We determine it completely for $$q=2,$$ and for $$k=2,$$ and provide upper and lower bounds in the gene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a24c7b3ecaf381187a18eeae141c577
https://doi.org/10.1007/s10623-018-0488-z
https://doi.org/10.1007/s10623-018-0488-z
Autor:
Sihem Mesnager, Gérard D. Cohen
Publikováno v:
Advances in Mathematics of Communications. 11:373-377
Since 1970, Boolean functions have been the focus of a lot of attention in cryptography. An important topic in symmetric ciphers concerns the cryptographic properties of Boolean functions and constructions of Boolean functions with good cryptographic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27f2522e158bfdc976f76a4f09b60f39
https://doi.org/10.3934/amc.2017031
https://doi.org/10.3934/amc.2017031
Publikováno v:
ENDM
ENDM, 2013, 44, pp.23-29
ENDM, 2013, 44, pp.23-29
Let Gk,n be the family of all graphs on the same n vertices each having at least k connected components. We are interested in the largest cardinality of a subfamily in which the union of any two of the member graphs has at most k−2 connected compon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6082ca954acc360977a06183afc03239
https://doi.org/10.1016/j.endm.2013.10.005
https://doi.org/10.1016/j.endm.2013.10.005
Publikováno v:
Designs, Codes and Cryptography. 70:3-7
In any connected, undirected graph G = (V, E), the distance d(x, y) between two vertices x and y of G is the minimum number of edges in a path linking x to y in G. A sphere in G is a set of the form S r (x) = {y ? V : d(x, y) = r}, where x is a verte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c109f4012666991dc0df6019639f62e7
https://doi.org/10.1007/s10623-012-9638-x
https://doi.org/10.1007/s10623-012-9638-x
Autor:
Gábor Simonyi, Emanuela Fachini, Ágnes Tóth, Marianne Fairthorne, János Körner, Gérard D. Cohen, Graham Brightwell
Publikováno v:
Electronic Notes in Discrete Mathematics. 38:195-199
The notion of permutation capacities is motivated by and shows similarities with the Shannon capacity of graphs and its generalization to directed graphs called Sperner capacity. We show that families of oriented paths have a different behaviour with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::156d5468142f707003be5472fbfa732a
https://doi.org/10.1016/j.endm.2011.09.033
https://doi.org/10.1016/j.endm.2011.09.033
Publikováno v:
European Journal of Combinatorics. 31:491-501
Let F^n be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance. For r>=1 and x@?F^n, we denote by B"r(x) the ball of radius r and centre x. A set C@?F^n is said to be an r-identifying code if the sets B"r(x)@?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96f6a7c08572bb6ca93c09c8351deab3
https://doi.org/10.1016/j.ejc.2009.03.032
https://doi.org/10.1016/j.ejc.2009.03.032
Autor:
Gábor Simonyi, Graham Brightwell, Emanuela Fachini, Ágnes Tóth, Marianne Fairthorne, Gérard D. Cohen, János Körner
Publikováno v:
SIAM Journal on Discrete Mathematics. 24:441-456
Korner and Malvenuto asked whether one can find $\binom{n}{\lfloor n/2\rfloor}$ linear orderings (i.e., permutations) of the first $n$ natural numbers such that any pair of them places two consecutive integers somewhere in the same position. This led
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e37312778b1be245b38adb17f34d8b07
https://doi.org/10.1137/090765407
https://doi.org/10.1137/090765407
Publikováno v:
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security, Institute of Electrical and Electronics Engineers, 2008, 3 (4), pp.673--683. ⟨10.1109/TIFS.2008.2002937⟩
IEEE Transactions on Information Forensics and Security, Institute of Electrical and Electronics Engineers, 2008, 3 (4), pp.673--683. ⟨10.1109/TIFS.2008.2002937⟩
International audience; Fuzzy commitment schemes, introduced as a link between biometrics and cryptography, are a way to handle biometric data matching as an error-correction issue. We focus here on finding the best error-correcting code with respect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab073652842e613bfc1a6e0b3957f4cd
https://doi.org/10.1109/tifs.2008.2002937
https://doi.org/10.1109/tifs.2008.2002937
Publikováno v:
European Journal of Combinatorics. 29:1353-1364
Consider a connected undirected bipartite graph G=([email protected]?A,E), with no edges inside I or A. For any vertex [email protected]?V, let N(v) be the set of neighbours of v. A code [email protected]?A is said to be discriminating if all the set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f895d79cae87a8fe3dd527c137a708ee
https://doi.org/10.1016/j.ejc.2007.05.006
https://doi.org/10.1016/j.ejc.2007.05.006