Boucher, Delphine

After giving a new interpretation of the skew metric defined in [4], we show that the decoding algorithm of [2] for skew Reed-Solomon codes remains valid with respect to this metric.

August, David A. Smith, Anne C.
Published in
SN Computer Science

Stream cipher encryption works by modulo-2 adding plaintext bits to keystream bits, which are in turn produced by successively updating a finite-state machine initialized to a secret starting state. PudgyTurtle is a way to encode the plaintext in a keystream-dependent manner before encryption. Since it can use keystream from any stream cipher, Pudg...

Boucher, Delphine

Itsykson, Dmitry Knop, Alexander Romashchenko, Andrei Sokolov, Dmitry

In 2004 Atserias, Kolaitis and Vardi proposed OBDD-based propositional proof systems that prove unsatisfiability of a CNF formula by deduction of identically false OBDD from OBDDs representing clauses of the initial formula. All OBDDs in such proofs have the same order of variables. We initiate the study of OBDD based proof systems that additionall...

Mills, Peter
Published in
SN Applied Sciences

A common method of generalizing binary to multi-class classification is the error correcting code (ECC). ECCs may be optimized in a number of ways, for instance by making them orthogonal. Here we test two types of orthogonal ECCs on seven different datasets using three types of binary classifier and compare them with three other multi-class methods...

Battail, Gérard
Published in
Bio Systems

Shannon's channel coding theorem (1948), a major result of information theory, paradoxically states that errorless communication is possible using an unreliable channel. Since then, engineers developed many error-correcting codes and decoding algorithms. A performance close to the predicted one was eventually achieved no earlier than the beginning ...

Nardi, Jade

We define a linear code by evaluating polynomials of bidegree in the Cox ring on Fq-rational points of a minimal Hirzebruch surface over the finite field Fq. We give explicit parameters of the code, notably using Gröbner bases. The minimum distance provides an upper bound of the number of Fq-rational points of a non-filling curve on a Hirzebruch su...

Cheraghchi Bashi Astaneh, M

We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the classical deletion channel, we give a special attention to the Poisson-repeat channel introduced by Mitzenmacher...

Tigreat, Philippe

The objective of research in Artificial Intelligence (AI) is to reproduce human cognitive abilities by means of modern computers. The results of the last few years seem to announce a technological revolution that could profoundly change society. We focus our interest on two fundamental cognitive aspects, learning and memory. Associative memories of...

Géraud, Rémi

Information security relies on the correct interaction of several abstraction layers: hardware, operating systems, algorithms, and networks. However, protecting each component of the technological stack has a cost; for this reason, many devices are left unprotected or under-protected. This thesis addresses several of these aspects, from a security ...