Ago-Erik Riet

Orcid: 0000-0002-8310-6809

According to our database1, Ago-Erik Riet authored at least 14 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound.
CoRR, 2024

Equal Requests are Asymptotically Hardest for Data Recovery.
Proceedings of the IEEE International Symposium on Information Theory, 2024

A Binary Linear Functional-Repair Regenerating Code on 72 Coding Spaces Related to PG(2, 8).
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
On some batch code properties of the simplex code.
Des. Codes Cryptogr., May, 2023

2022
Batch Codes for Asynchronous Recovery of Data.
IEEE Trans. Inf. Theory, 2022

Maximal Sets of $k$-Spaces Pairwise Intersecting in at Least a $(k-2)$-Space.
Electron. J. Comb., 2022

Update and Repair Efficient Storage Codes with Availability via Finite Projective Planes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2018
Asynchronous Batch and PIR Codes from Hypergraphs.
Proceedings of the IEEE Information Theory Workshop, 2018

2016
Permutation codes, source coding and a generalisation of Bollobás-Lubell-Yamamoto-Meshalkin and Kraft inequalities.
CoRR, 2016

Generalisation of Kraft inequality for source coding into permutations.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Graph Saturation Games.
Electron. Notes Discret. Math., 2015

F-saturation games.
Discret. Math., 2015

New bounds for permutation codes in Ulam metric.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2011
Completing partial packings of bipartite graphs.
J. Comb. Theory A, 2011


  Loading...