AbstractThe known deterministic algorithms for loss-resilient encoding/decoding involve computations with Cauchy matrices but only weakly exploit the matrix structure. We propose several modifications with more extensive use of the matrix structure to accelerate the computations substantially
International audienceFor matrices with displacement structure, basic operations like multiplication...
International audienceLinear systems with structures such as Toeplitz-, Vandermonde-or Cauchy-likene...
Structured linear algebra techniques are a versatile set of tools; they enable one to deal at once w...
We present randomized constructions of linear-time encodable and decodable codes that can transmit o...
We present randomized constructions of linear-time encodable and decodable codes that can transmit o...
We present randomized constructions of linear-time encodable and decodable codes that can transmit o...
The Vandermonde matrix and Cauchy matrix are classical and are encountered in polynomial and rationa...
AbstractAn effective algorithm of [M. Morf, Ph.D. Thesis, Department of Electrical Engineering, Stan...
International audienceReed Solomon RS(n, k) codes are Maximum Distance Sep- arable (MDS) ideal codes...
Several recent works have used coding-theoretic ideas for mitigating the effect of stragglers in dis...
AbstractThis paper analyzes the factorization of the inverse of a Cauchy-Vandermonde matrix as a pro...
In [P90] we proposed to employ Vandermonde and Hankel multipliers to transform into each other the m...
We propose new effective randomized algorithms for some fundamental matrix computations such as prec...
Distributed matrix computations (matrix-vector and matrix-matrix multiplications) are at the heart o...
A central concern for many learning algorithms is how to efficiently store what the algorithm has le...
International audienceFor matrices with displacement structure, basic operations like multiplication...
International audienceLinear systems with structures such as Toeplitz-, Vandermonde-or Cauchy-likene...
Structured linear algebra techniques are a versatile set of tools; they enable one to deal at once w...
We present randomized constructions of linear-time encodable and decodable codes that can transmit o...
We present randomized constructions of linear-time encodable and decodable codes that can transmit o...
We present randomized constructions of linear-time encodable and decodable codes that can transmit o...
The Vandermonde matrix and Cauchy matrix are classical and are encountered in polynomial and rationa...
AbstractAn effective algorithm of [M. Morf, Ph.D. Thesis, Department of Electrical Engineering, Stan...
International audienceReed Solomon RS(n, k) codes are Maximum Distance Sep- arable (MDS) ideal codes...
Several recent works have used coding-theoretic ideas for mitigating the effect of stragglers in dis...
AbstractThis paper analyzes the factorization of the inverse of a Cauchy-Vandermonde matrix as a pro...
In [P90] we proposed to employ Vandermonde and Hankel multipliers to transform into each other the m...
We propose new effective randomized algorithms for some fundamental matrix computations such as prec...
Distributed matrix computations (matrix-vector and matrix-matrix multiplications) are at the heart o...
A central concern for many learning algorithms is how to efficiently store what the algorithm has le...
International audienceFor matrices with displacement structure, basic operations like multiplication...
International audienceLinear systems with structures such as Toeplitz-, Vandermonde-or Cauchy-likene...
Structured linear algebra techniques are a versatile set of tools; they enable one to deal at once w...
DOI
Add to ORKG