default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoni Con
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i13]Peter Beelen, Roni Con, Anina Gruica, Maria Montanucci, Eitan Yaakobi:
Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-1/2 Codes. CoRR abs/2501.11371 (2025)- 2024
- [j6]Roni Con
, Amir Shpilka, Itzhak Tamo:
Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions. IEEE Trans. Inf. Theory 70(7): 5012-5016 (2024) - [j5]Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters:
Repairing Reed-Solomon Codes Over Prime Fields via Exponential Sums. IEEE Trans. Inf. Theory 70(12): 8587-8594 (2024) - [c7]Roni Con, Ryan Gabrys, Eitan Yaakobi:
One Code Fits All: Strong Stuck-At Codes for Versatile Memory Encoding. ISIT 2024: 2634-2639 - [c6]Shubhransh Singhvi, Roni Con, Han Mao Kiah, Eitan Yaakobi:
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes. ISIT 2024: 2832-2837 - [i12]Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters:
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. CoRR abs/2402.02358 (2024) - [i11]Shubhransh Singhvi, Roni Con, Han Mao Kiah, Eitan Yaakobi:
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes. CoRR abs/2403.07754 (2024) - [i10]Roni Con, Ryan Gabrys, Eitan Yaakobi:
One Code Fits All: Strong stuck-at codes for versatile memory encoding. CoRR abs/2403.19061 (2024) - [i9]Roni Con, Dorsa Fathollahi, Ryan Gabrys, Mary Wootters, Eitan Yaakobi:
Robust Gray Codes Approaching the Optimal Rate. CoRR abs/2406.17689 (2024) - [i8]Roni Con, Zeyu Guo, Ray Li, Zihan Zhang:
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets. CoRR abs/2407.07299 (2024) - [i7]Roni Con:
Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions. CoRR abs/2412.17003 (2024) - 2023
- [j4]Roni Con, Amir Shpilka, Itzhak Tamo:
Reed Solomon Codes Against Adversarial Insertions and Deletions. IEEE Trans. Inf. Theory 69(5): 2991-3000 (2023) - [c5]Ittai Rubinstein, Roni Con:
Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel. ISIT 2023: 927-932 - [c4]Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters:
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. ISIT 2023: 1330-1335 - [i6]Ittai Rubinstein, Roni Con:
Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel. CoRR abs/2305.07156 (2023) - [i5]Roni Con, Amir Shpilka, Itzhak Tamo:
Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions. CoRR abs/2311.02771 (2023) - 2022
- [j3]Roni Con, Amir Shpilka:
Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel. IEEE Trans. Inf. Theory 68(5): 2920-2940 (2022) - [j2]Roni Con, Itzhak Tamo:
Nonlinear Repair of Reed-Solomon Codes. IEEE Trans. Inf. Theory 68(8): 5165-5177 (2022) - [j1]Roni Con, Amir Shpilka, Itzhak Tamo:
Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions. IEEE Trans. Inf. Theory 68(10): 6516-6526 (2022) - [c3]Roni Con, Itzhak Tamo:
Nonlinear Repair Schemes of Reed-Solomon Codes. ITCS 2022: 50:1-50:1 - [c2]Roni Con, Amir Shpilka, Itzhak Tamo:
Reed Solomon Codes Against Adversarial Insertions and Deletions. ISIT 2022: 2940-2945 - [i4]Roni Con, Amir Shpilka, Itzhak Tamo:
Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions. CoRR abs/2201.06130 (2022) - 2021
- [i3]Roni Con, Itzhak Tamo:
Nonlinear Repair Schemes of Reed-Solomon Codes. CoRR abs/2104.01652 (2021) - [i2]Roni Con, Amir Shpilka, Itzhak Tamo:
Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions. CoRR abs/2107.05699 (2021) - 2020
- [c1]Roni Con, Amir Shpilka:
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. ISIT 2020: 84-89
2010 – 2019
- 2019
- [i1]Roni Con, Amir Shpilka:
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel. CoRR abs/1909.10177 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-24 21:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
