Skip to main content
Go to the home page of the European Commission (opens in new window)
English English
CORDIS - EU research results
CORDIS

Informational properties of networks under communication constraints

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Multivariate Public Key Cryptosystem from Sidon Spaces (opens in new window)

Author(s): Netanel Raviv, Ben Langton, Itzhak Tamo
Published in: 2021
Publisher: CoRR
DOI: 10.48550/arxiv.2106.07785

Reed Solomon Codes Against Adversarial Insertions and Deletions (opens in new window)

Author(s): Con, Roni; Shpilka, Amir; Tamo, Itzhak
Published in: Issue 1, 2022
Publisher: CoRR
DOI: 10.48550/arxiv.2107.05699

List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate (opens in new window)

Author(s): Goldberg, Eitan; Shangguan, Chong; Tamo, Itzhak
Published in: Issue 1, 2021, ISSN 2331-8422
Publisher: CoRR
DOI: 10.48550/arxiv.2105.14754

Singleton-type bounds for list-decoding and list-recovery, and related results (opens in new window)

Author(s): Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Published in: 2021
Publisher: CoRR
DOI: 10.48550/arxiv.2112.05592

Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel (opens in new window)

Author(s): Ittai Rubinstein, Roni Con
Published in: 2023
Publisher: arXive
DOI: 10.48550/arxiv.2305.07156

Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions (opens in new window)

Author(s): Roni Con, Amir Shpilka, Itzhak Tamo
Published in: 2022
Publisher: CoRR
DOI: 10.48550/arxiv.2201.06130

Bounds and Constructions for Generalized Batch Codes (opens in new window)

Author(s): Xiangliang Kong, Ohad Elishco
Published in: 2023
Publisher: arXive
DOI: 10.48550/arxiv.2309.06806

Locally repairable convertible codes with optimal access costs (opens in new window)

Author(s): Xiangliang Kong
Published in: 2023
Publisher: arXive
DOI: 10.48550/arxiv.2308.06802

Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions (opens in new window)

Author(s): Roni Con, Amir Shpilka, Itzhak Tamo
Published in: 2023
Publisher: arXiv
DOI: 10.48550/arxiv.2311.02771

Combinatorial Alphabet-Dependent Bounds for Insdel Codes (opens in new window)

Author(s): Xiangliang Kong, Itzhak Tamo, Hengjia Wei
Published in: IEEE Transactions on Information Theory, Issue 71, 2025, Page(s) 3544-3559, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2025.3545061

Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes (opens in new window)

Author(s): Itzhak Tamo
Published in: IEEE Transactions on Information Theory, Issue 70, 2024, Page(s) 8659-8668, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2024.3402171

A construction of maximally recoverable codes (opens in new window)

Author(s): Barg, Alexander; Chen, Zitan; Tamo, Itzhak
Published in: Designs, Codes and Cryptography, 2022, ISSN 0925-1022
Publisher: Kluwer Academic Publishers
DOI: 10.1007/s10623-022-01020-8

List-Decoding and List-Recovery of Reed–Solomon Codes Beyond the Johnson Radius for Every Rate (opens in new window)

Author(s): Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Published in: IEEE Transactions on Information Theory, Issue 69, 2024, Page(s) 2261-2268, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2022.3222877

GENERALIZED SINGLETON BOUND AND LIST-DECODINGREED--SOLOMON CODES BEYOND THE JOHNSON RADIUS (opens in new window)

Author(s): Chong Shangguan , Itzhak Tamo
Published in: SIAM, Issue 52(3) May 23, 2023 online, 2023, Page(s) 684 - 717, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m138795x

Corrections to “Reed Solomon Codes Against Adversarial Insertions and Deletions” (opens in new window)

Author(s): Roni Con, Amir Shpilka, Itzhak Tamo
Published in: IEEE Transactions on Information Theory, Issue 71, 2025, Page(s) 3250-3251, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2025.3538114

Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (opens in new window)

Author(s): Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Published in: SIAM Journal on Computing, Issue 53, 2024, Page(s) 389-430, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m1463707

Reed Solomon Codes Against Adversarial Insertions and Deletions (opens in new window)

Author(s): Roni Con, Amir Shpilka, Itzhak Tamo
Published in: IEEE Transactions on Information Theory, Issue 69, 2025, Page(s) 2991-3000, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2023.3237711

Bounds on the Capacity of Private Information Retrieval Over Graphs (opens in new window)

Author(s): Bar Sadeh, Yujie Gu, Itzhak Tamo
Published in: IEEE Transactions on Information Forensics and Security, Issue 18, 2022, Page(s) 261-273, ISSN 1556-6013
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tifs.2022.3220034

Nonlinear Repair of Reed-Solomon Codes (opens in new window)

Author(s): Roni Con, Itzhak Tamo
Published in: IEEE Transactions on Information Theory, Issue 68, 2024, Page(s) 5165-5177, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2022.3167615

Repairing Reed-Solomon Codes Over Prime Fields via Exponential Sums (opens in new window)

Author(s): Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters
Published in: IEEE Transactions on Information Theory, Issue 70, 2024, Page(s) 8587-8594, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2024.3449041

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings

Author(s): Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Published in: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), Issue 1, 2024, Page(s) 389 - 430
Publisher: Society for Industrial and Applied Mathematics

Non-Binary Covering Codes for Low-Access Computations (opens in new window)

Author(s): Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Published in: 2024 IEEE International Symposium on Information Theory (ISIT), 2024, Page(s) 2772-2777
Publisher: IEEE
DOI: 10.1109/isit57864.2024.10619536

Access-Redundancy Tradeoffs in Quantized Linear Computations (opens in new window)

Author(s): Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Published in: 2023 IEEE International Symposium on Information Theory, 2023
Publisher: IEEE
DOI: 10.48550/arxiv.2305.06101

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings (opens in new window)

Author(s): Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters
Published in: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2021
Publisher: IEEE
DOI: 10.1109/focs52979.2021.00074

Bounds on the Capacity of PIR over Graphs (opens in new window)

Author(s): Bar Sadeh; Yujie Gu; Itzhak Tamo
Published in: ISIT, Issue 3, 2021
Publisher: IEEE
DOI: 10.1109/isit45174.2021.9518086

Access-Redundancy Tradeoffs in Quantized Linear Computations (opens in new window)

Author(s): Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Published in: 2023 IEEE International Symposium on Information Theory (ISIT), 2023, Page(s) 1967-1972
Publisher: IEEE
DOI: 10.1109/isit54713.2023.10206571

Nonlinear Repair Schemes of Reed-Solomon Codes (opens in new window)

Author(s): Con, Roni; Tamo, Itzhak
Published in: Innovations in Theoretical Computer Science, Issue 3, 2022, ISBN 978-3-95977-217-4
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.itcs.2022.50

Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes (opens in new window)

Author(s): Itzhak Tamo
Published in: 2024 IEEE International Symposium on Information Theory (ISIT), 2024, Page(s) 3558-3563
Publisher: IEEE
DOI: 10.1109/isit57864.2024.10619274

Searching for OpenAIRE data...

There was an error trying to search data from OpenAIRE

No results available

My booklet 0 0