Tree codes and a conjecture on exponential sums

DOI10.1145/2554797.2554813zbMATH Open1364.94681arXiv1308.6007OpenAlexW2109131159MaRDI QIDQ2988874FDOQ2988874

Authors: Cristopher Moore, Leonard J. Schulman 

Publication date: 19 May 2017

Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)

Abstract: We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The available numerical evidence is consistent with the conjecture and is sufficient to certify codes for significant-length communications.

Full work available at URL: https://arxiv.org/abs/1308.6007

Recommendations

• Linear tree codes and the problem of explicit constructions
• Publication:4886128
• On decoding Cohen-Haeupler-Schulman tree codes
• Explicit binary tree codes with polylogarithmic size alphabet
• Towards deterministic tree code constructions

zbMATH Keywords

exponential sumerror-correcting codesinteractive communication

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25) Exponential sums (11T23)

Cites Work

• A hierarchy of polynomial time lattice basis reduction algorithms
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Evaluating Branching Programs on Encrypted Data
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• On lattices, learning with errors, random linear codes, and cryptography
• Trapdoors for hard lattices and new cryptographic constructions
• Title not available (Why is that?)
• (Leveled) fully homomorphic encryption without bootstrapping
• On lattices, learning with errors, random linear codes, and cryptography
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Bounds for Width Two Branching Programs
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• New lattice-based cryptographic constructions
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Toward basing fully homomorphic encryption on worst-case hardness

Cited In (6)

• Title not available (Why is that?)
• Palette-alternating tree codes
• Title not available (Why is that?)
• Linear tree codes and the problem of explicit constructions
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture

This page was built for publication: Tree codes and a conjecture on exponential sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988874)