The following pages link to Itzhak Tamo (Q517735):
Displaying 43 items.
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes (Q517737) (← links)
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices (Q543906) (← links)
- The hat guessing number of graphs (Q777481) (← links)
- Multivariate public key cryptosystem from Sidon spaces (Q2061921) (← links)
- A construction of maximally recoverable codes (Q2119945) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- Optimal Locally Repairable Codes and Connections to Matroid Theory (Q2976387) (← links)
- Explicit Minimum Storage Regenerating Codes (Q2976661) (← links)
- Bounds on the Parameters of Locally Recoverable Codes (Q2976756) (← links)
- A Family of Optimal Locally Recoverable Codes (Q2986212) (← links)
- An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes (Q2986387) (← links)
- Access Versus Bandwidth in Codes for Storage (Q2986427) (← links)
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding (Q2989370) (← links)
- Optimal Rebuilding of Multiple Erasures in MDS Codes (Q2989643) (← links)
- On the Labeling Problem of Permutation Group Codes Under the Infinity Metric (Q2989749) (← links)
- A Bound on the Shannon Capacity via a Linear Programming Variation (Q4584958) (← links)
- MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth (Q4682932) (← links)
- Nonlinear Repair of Reed-Solomon Codes (Q5096980) (← links)
- Error Correction Based on Partial Information (Q5123793) (← links)
- Private Information Retrieval in Graph-Based Replication Systems (Q5123948) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- Gradient Coding From Cyclic MDS Codes and Expander Graphs (Q5138910) (← links)
- Minimum Guesswork With an Unreliable Oracle (Q5138913) (← links)
- New Turán Exponents for Two Extremal Hypergraph Problems (Q5138977) (← links)
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius (Q5144940) (← links)
- The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size (Q5223961) (← links)
- Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme (Q5281432) (← links)
- Locally Recoverable Codes on Algebraic Curves (Q5369845) (← links)
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes (Q5375529) (← links)
- Construction of Sidon Spaces With Applications to Coding (Q5375585) (← links)
- (Q6126282) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- List-Decoding and List-Recovery of Reed–Solomon Codes Beyond the Johnson Radius for Every Rate (Q6153667) (← links)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
- Singleton-type bounds for list-decoding and list-recovery, and related results (Q6187335) (← links)
- Repairing Reed–Solomon Codes Evaluated on Subspaces (Q6195687) (← links)
- Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions (Q6195688) (← links)
- Reed Solomon Codes Against Adversarial Insertions and Deletions (Q6197481) (← links)
- Optimal two-dimensional Reed-Solomon codes correcting insertions and deletions (Q6576665) (← links)
- Efficient algorithms for constructing minimum-weight codewords in some extended binary BCH codes (Q6670212) (← links)
- Access-redundancy tradeoffs in quantized linear computations (Q6670216) (← links)
- Repairing Reed-Solomon codes over prime fields via exponential sums (Q6670281) (← links)
- Tighter list-size bounds for list-decoding and recovery of folded Reed-Solomon and multiplicity codes (Q6670288) (← links)
