V. Protasov

activity

20062022

most citedOn the complexity of computing the capacity of codes that avoid forbidden difference patterns

23 citations · 72 across the 27 of their papers we have counts for

collaborators

Showing 2006Show all

2 papers · 1 filter

cs.CC2006★ 1 cited

Efficient algorithms for deciding the type of growth of products of integer matrices

Raphaël Jungers, Vladimir Protasov, Vincent D. Blondel

For a given finite set $Σ$ of matrices with nonnegative integer entries we study the growth of $t max (Σ) = max {∥ A_{1} ... A_{t} ∥ : A_{i} \in Σ} .$ We show how to determine in p…

cs.IT2006★ 23 cited

On the complexity of computing the capacity of codes that avoid forbidden difference patterns

Vincent D. Blondel, Raphael Jungers, Vladimir Protasov

We consider questions related to the computation of the capacity of codes that avoid forbidden difference patterns. The maximal number of $n$ -bit sequences whose pairwise differenc…