618 citations · 1.2k across the 56 of their papers we have counts for
58 papers · 1 filter
Quantum Codes with Transversal Gates and Sublinear -Stabilizers
Ohad Elishco, Itzhak Tamo
We construct asymmetric quantum CSS codes with transversal \(CCZ\) gates from algebraic expander codes \cite{KT26}. For every fixed \(m\ge 3\), our growing-alphabet codes have leng…
Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
Amit Berman, Yaron Shany, Itzhak Tamo
Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part…
Algebraic Expander Codes
Swastik Kopparty, Itzhak Tamo
Expander (Tanner) codes combine sparse graphs with local constraints, enabling linear-time decoding and asymptotically good distance--rate tradeoffs. A standard constraint-counting…
New Bounds and Constructions for Variable Packet-Error Coding
Xiangliang Kong, Xin Wang, Ron M. Roth +1
In this paper, we consider the problem of variable packet-error coding, which emerges in network communication scenarios where a source transmits information to a destination throu…
New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
Xiangliang Kong, Shreya Meel, Thomas Jacob Maranzatto +2
In this paper, we study the problem of private information retrieval (PIR) in both graph-based and multigraph-based replication systems, where each file is stored on exactly two se…
Bounds on Box Codes
Michael Langberg, Moshe Schwartz, Itzhak Tamo
Let be the minimum length of a -ary code of size and minimum distance . Bounding is a fundamental problem that lies at the heart of coding theory. T…