Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Polynomial code

Related publications (7)

Optimal Computational Split-state Non-malleable Codes

Divesh Aggarwal

Non-malleable codes are a generalization of classical error-correcting codes where the act of "corrupting" a codeword is replaced by a "tampering" adversary. Non-malleable codes guarantee that the message contained in the tampered codeword is either the or ...

Springer Int Publishing Ag2016

Revisiting the Sanders-Bogolyubov-Ruzsa Theorem in F-p(n) and its Application to Non-malleable Codes

Divesh Aggarwal

Non-malleable codes (NMCs) protect sensitive data against degrees of corruption that prohibit error detection, ensuring instead that a corrupted codeword decodes correctly or to something that bears little relation to the original message. The split-state ...

Ieee2016

From Polar to Reed-Muller Codes : Unified Scaling, Non-standard Channels, and a Proven Conjecture

Marco Mondelli

The year 2016, in which I am writing these words, marks the centenary of Claude Shannon, the father of information theory. In his landmark 1948 paper "A Mathematical Theory of Communication", Shannon established the largest rate at which reliable communica ...

EPFL2016

Asynchronous Decoding of Error Potentials During the Monitoring of a Reaching Task

Ricardo Andres Chavarriaga Lozano, Inaki Asier Iturrate Gil

Brain-machine interfaces (BMIs) have demonstrated how they can be used for reaching tasks with both invasive and non-invasive signal recording methods. Despite the constant improvements in this field, there still exist diverse factors to overcome before ac ...

2015

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Sebastian Faust

Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c' = f(c) such that c c, then the tampered message x contained in c reveals no inf ...

Springer2014

Encoding and decoding of generalized Reed-Solomon codes using parallel processing techniques

Mohammad Amin Shokrollahi

A system, computer program, and/or method for encoding data that can correct r/2 errors. The original symbols are transformed using a Fourier transform of length p. Generator polynomials are used to encode the p blocks separately, and an inverse Fourier tr ...

2012

Dataflow/Actor-Oriented language for the design of complex signal processing systems

Marco Mattavelli, Christophe Lucarz, Ghislain Roquier

Signal processing algorithms become more and more complex and the algorithm architecture adaptation and design processes cannot any longer rely only on the intuition of the designers to build efficient systems. Specific tools and methods are needed to cope ...

2008