80 citations · 121 across the 14 of their papers we have counts for
17 papers
Maximum weight spectrum codes with reduced length
Gerard D Cohen, Ludo Tolhuizen
A q-ary linear code of dimension k is called a maximum weight spectrum (MWS) code if it has the maximum possible number (viz. (q^k-1)/(q-1)) of different non-zero weights. We const…
Interlocked permutations
Gerard Cohen, Emanuela Fachini, Janos Korner
The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We…
How many weights can a linear code have ?
Minjia Shi, Hongwei Zhu, Patrick Solé +1
We study the combinatorial function the maximum number of nonzero weights a linear code of dimension over $\F_q$ can have. We determine it completely for and f…
Path separation by short cycles
Gérard Cohen, Emanuela Fachini, János Körner
Two Hamilton paths in are separated by a cycle of length if their union contains such a cycle. For small fixed values of we bound the asymptotics of the maximum cardi…
Zero-error capacity of binary channels with memory
Gérard Cohen, Emanuela Fachini, János Körner
We begin a systematic study of the problem of the zero--error capacity of noisy binary channels with memory and solve some of the non--trivial cases.
Towards Secure Two-Party Computation from the Wire-Tap Channel
Hervé Chabanne, Gérard Cohen, Alain Patey
We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the sec…