Informational properties of networks under communication constraints

Project Information

InfoNet

Grant agreement ID: 852953

DOI 10.3030/852953

EC signature date 15 October 2019

Start date 1 October 2020

End date 30 September 2025

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 1 474 375,00

EU contribution € 1 474 375,00

Coordinated by

TEL AVIV UNIVERSITY
Israel

Publications

Other (9)

Multivariate Public Key Cryptosystem from Sidon Spaces

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

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

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

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

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

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

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

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

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

Conference proceedings (4)

Access-Redundancy Tradeoffs in Quantized Linear Computations

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

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

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

Nonlinear Repair Schemes of Reed-Solomon Codes

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

Peer reviewed articles (2)

A construction of maximally recoverable codes

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

GENERALIZED SINGLETON BOUND AND LIST-DECODINGREED--SOLOMON CODES BEYOND THE JOHNSON RADIUS

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