activity
20122026
most citedThe Curious Case of the Diamond Network

2 citations · 3 across the 20 of their papers we have counts for

collaborators
Showing cs.ITShow all

23 papers · 1 filter

cs.IT2026

A New Invariant for Prime Alternating Knots From Error-Correcting Codes

Altan B. Kilic, Ruud Pellikaan, Alberto Ravagnan

This paper shows that the Alexander-Briggs code of a knot gives rise to a new invariant that distinguishes prime alternating knots. The restriction to prime alternating knots preci…

cs.IT2026

Capacity of Non-Separable Networks with Restricted Adversaries

Christopher Hojny, Altan B. Kılıç, Sascha Kurz +1

This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to opera…

cs.IT2025

The Star Product of Uniformly Random Codes

Johan Vester Dinesen, Ragnar Freij-Hollanti, Camilla Hollanti +2

We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We use a corr…

cs.IT2025

The Length of Functional Batch and PIR Codes

Altan B. Kilic, Alberto Ravagnani, Flavio Salizzoni

We consider the problem of computing the minimum length of functional batch and PIR codes of fixed dimension and for a fixed list size, over an arbitrary finite field. We recover,…

cs.IT2025

Multishot Capacity of Networks with Restricted Adversaries

Giuseppe Cotardo, Gretchen L. Matthews, Alberto Ravagnani +1

We investigate adversarial network coding and decoding, focusing on the multishot regime and when the adversary is restricted to operate on a vulnerable region of the network. Erro…

cs.IT2024

On the Parameters of Codes for Data Access

Altan B. Kilic, Alberto Ravagnani, Emina Soljanin

This paper studies two crucial problems in the context of coded distributed storage systems directly related to their performance: 1) for a fixed alphabet size, determine the minim…