Cover Image

Structured Approximation of Toeplitz Matrices and Subspaces

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fannjiang, Albert, Li, Weilin
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multidimensional Gradient-MUSIC: A Global Nonconvex Optimization Framework for Optimal Resolution
by: Fannjiang, Albert, et al.
Published: (2026)

Optimality of Gradient-MUSIC for spectral estimation
by: Fannjiang, Albert, et al.
Published: (2025)

Noise-Robust One-Bit Diffraction Tomography and Optimal Dose Fractionation
by: Chen, Pengwen, et al.
Published: (2023)

Subspace and DOA estimation under coarse quantization
by: Dirksen, Sjoerd, et al.
Published: (2025)

Numerical Techniques for the Maximum Likelihood Toeplitz Covariance Matrix Estimation: Part I. Symmetric Toeplitz Matrices
by: Abramovich, Yuri, et al.
Published: (2025)

Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random Matrix
by: Huang, Gao, et al.
Published: (2024)

Rank Resilience of Pattern Matrices against Structured Perturbations with Applications
by: Zhang, Yuan, et al.
Published: (2021)

Subspace Phase Retrieval
by: Xu, Mengchu, et al.
Published: (2022)

LCPs of Subspace Codes
by: Bhowmick, Sanjit
Published: (2026)

Subspace Decomposition of Coset Codes
by: Hunn, David, et al.
Published: (2024)

Schubert Subspace Codes
by: Alfarano, Gianira N., et al.
Published: (2024)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
by: Goyal, Rohan, et al.
Published: (2025)

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
by: Wu, Binghong, et al.
Published: (2026)

Completion of Matrices with Low Description Complexity
by: Riegler, Erwin, et al.
Published: (2023)

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $MAM^*$!
by: Boahen, Edem, et al.
Published: (2025)

Recovery Sets of Subspaces from a Simplex Code
by: Chee, Yeow Meng, et al.
Published: (2024)

Decentralized Generalized Approximate Message-Passing for Tree-Structured Networks
by: Takeuchi, Keigo
Published: (2023)

Improved Probabilistic Lower Bounds for Separable Matrices
by: Goshkoder, Daniil, et al.
Published: (2024)

Subspace-Informed Matrix Completion
by: Ardakani, Hamideh. Sadat Fazael, et al.
Published: (2024)

Subspace Coding for Spatial Sensing
by: Mahdavifar, Hessam, et al.
Published: (2024)

Blind Identification of Channel Codes: A Subspace-Coding Approach
by: Singh, Pramod, et al.
Published: (2026)

Double Toeplitz codes and their average weight enumerators
by: Harada, Masaaki, et al.
Published: (2026)

Characterization of Exponential Families of Lumpable Stochastic Matrices
by: Watanabe, Shun, et al.
Published: (2024)

Quasi-recursive MDS Matrices over Galois Rings
by: Ali, Shakir, et al.
Published: (2025)

Toward Quantum CSS-T Codes from Sparse Matrices
by: Camps-Moreno, Eduardo, et al.
Published: (2024)

Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval
by: Makkonen, Okko, et al.
Published: (2024)

An Identity of Hankel Matrices Generated from the Moments of Gaussian Distribution
by: Hu, Sha
Published: (2024)

Quantum Cross Subspace Alignment Codes via the $N$-sum Box Abstraction
by: Lu, Yuxiang, et al.
Published: (2023)

On the Counting of Involutory MDS Matrices
by: Samanta, Susanta
Published: (2023)

Sparse Signal Recovery From Quadratic Systems with Full-Rank Matrices
by: Wen, Jinming, et al.
Published: (2025)

Golay Complementary Sequences of Arbitrary Length and Asymptotic Existence of Hadamard Matrices
by: Du, Cheng, et al.
Published: (2024)

Explicit Constant-Alphabet Subspace Design Codes
by: Goyal, Rohan, et al.
Published: (2026)

Federated PCA and Estimation for Spiked Covariance Matrices: Optimal Rates and Efficient Algorithm
by: Li, Jingyang, et al.
Published: (2024)

Splitting Alternating Algorithms for Sparse Solutions of Linear Systems with Concatenated Orthogonal Matrices
by: Zhao, Yun-Bin, et al.
Published: (2025)

A Global Characterization of $f$-Divergences Yielding PSD Mutual-Information Matrices
by: Robertson, Zachary
Published: (2026)

How Many Matrices Should I Prepare To Polarize Channels Optimally Fast?
by: Wang, Hsin-Po, et al.
Published: (2024)

Constrained Gaussian Wasserstein Optimal Transport with Commutative Covariance Matrices
by: Chen, Jun, et al.
Published: (2025)

Beyond MMSE: Rank-1 Subspace Channel Estimator for Massive MIMO Systems
by: Li, Bin, et al.
Published: (2024)

Quantization of KLT Matrices via GMRF Modeling of Image Blocks for Adaptive Transform Coding
by: Boragolla, Rashmi, et al.
Published: (2024)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)