Fractional covers for convolution products
From MaRDI portal
Publication:1923650
DOI10.1007/BF03322181zbMath0864.46004OpenAlexW2064157175MaRDI QIDQ1923650
Publication date: 26 June 1997
Published in: Results in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03322181
exact coverfractional coverconvolution coverfinitely supported covergeneralized Galois sequenceminimal length coverpolygonal space
System identification (93B30) Sequence spaces (including Köthe sequence spaces) (46A45) Convolution, factorization for one variable harmonic analysis (42A85) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
Sample complexity of worst-case \(H^\infty\)-identification ⋮ Complexity of identification of linear systems with rational transfer functions
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- The sample complexity of worst-case identification of FIR linear systems
- Robust identification of strongly stabilizable systems
- On the time complexity of worst-case system identification
- Interpolation in Normed Spaces from the Values of Linear Functionals
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: Fractional covers for convolution products