Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

COHOMCODES

Financiado

Cerrado

Robust Codes from Higher Dimesional Expanders

Error correcting codes play a fundamental role in computer science. Good codes are codes with rate and distance that are asymptotically optimal. Some of the most successful good codes are constructed using expander graphs. In rece... ver más

31/01/2020

BIU

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

BAR ILAN UNIVERSITY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo FP7 notifico la concesión del proyecto el día 2020-01-31 No tenemos la información de la convocatoria

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

1 Participantes

BIU

0.00€ | Lider

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

LEAP Local-to-global Expansion and PCPs 2M€ Cerrado

VERICOMP Foundations of Verifiable Computing 2M€ Cerrado

ECCC Error-correcting Codes and Computation 1M€ Cerrado

EPRICOT Efficient Proofs and Computation A Unified Algebraic Appro... 2M€ Cerrado

EXT Randomness Extractors Constructions and Applications 1M€ Cerrado

MCT Metacomputational Complexity Theory 213K€ Cerrado

Líder del proyecto

BAR ILAN UNIVERSITY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 1M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto Error correcting codes play a fundamental role in computer science. Good codes are codes with rate and distance that are asymptotically optimal. Some of the most successful good codes are constructed using expander graphs. In recent years a new notion of {\em robust} error correcting codes, known as locally testable codes (LTCs), has emerged. Locally testable codes are codes in which a proximity of a vector to an error correcting code can be achieved by probing the vector in {\em constant} many locations (independent of its length). LTCs are at the heart of Probabilistically Checkable Proofs (PCPs) and their construction has been sought since the discovery of the PCP theorem in the early 1990s. Despite 20 years of research, it is still widely open whether good locally testable codes exist. LTCs present completely new challenge to the field of error correcting codes. In the old paradigm a random code is a good code and the main focus was to construct explicit codes that imitate the random code. However, a random code is not an LTC. Thus, contrary to traditional codes, there are no natural candidates for LTCs. The known constructions of robust codes are ad hoc, and there is a lack of theory that explains their existence. The goal of the current research plan is to harness the emerging field of higher dimensional expanders and their topological properties for a systematic study of robust error correcting codes. Higher dimensional expanders are natural candidates for obtaining robust codes since they offer a strong form of redundancy that is essential for robustness. Such form of redundancy is lacking by their one dimensional analogue (i.e., expander graphs). Hence, the known expander codes are not robust. We expect that our study will draw new connections between error correcting codes, high dimensional expanders, topology and probability that will shed new light on these fields, and in particular, will advance the constructing of good and robust codes.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores