Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > TOMER MANKET:
All reports by Author Tomer Manket:

TR26-272 | 24th October 2026
Gil Cohen, Tomer Manket

Beating the Gilbert–Varshamov Bound at Alphabet Size 42

The question of whether the Gilbert-Varshamov bound (1952, 1957) gives the optimal tradeoff between rate and distance is one of the most fundamental in coding theory. It is a central instance of the broader question of how far algebraic structure can surpass the benchmark provided by the probabilistic method.

In ... more >>>


TR25-174 | 10th November 2025
Gil Cohen, Dean Doron, Noam Goldgraber, Tomer Manket

Tracing AG Codes: Toward Meeting the Gilbert--Varshamov Bound

One of the oldest problems in coding theory is to match the Gilbert--Varshamov bound with explicit binary codes. Over larger---yet still constant-sized---fields, algebraic-geometry codes are known to beat the GV bound. In this work, we leverage this phenomenon by taking traces of AG codes. Our hope is that the margin ... more >>>


TR24-090 | 12th May 2024
Gil Cohen, Dean Doron, Tomer Manket, Edward Pyne, Yichuan Wang, Tal Yankovitz

A Study of Error Reduction Polynomials

Revisions: 1

Error reduction procedures play a crucial role in constructing weighted PRGs [PV'21, CDRST'21], which are central to many recent advances in space-bounded derandomization. The fundamental method driving error reduction procedures is the Richardson iteration, which is adapted from the literature on fast Laplacian solvers. In the context of space-bounded derandomization, ... more >>>




ISSN 1433-8092 | Imprint