New SDP bounds for sum-rank-metric codes outperform prior bounds in experiments, with shown equivalences between Delsarte and eigenvalue LP bounds plus non-existence results for certain optimal codes.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
Provides an AMP-based asymptotic analysis of SLOPE, characterizing iterate dynamics via state evolution and proving asymptotic convergence to the SLOPE solution.
Projectivizing quantum kinematics produces meromorphic functions characterizing coherent circuits for quantum error correction and magic state distillation.
The minimum distance of the Euclidean dual of each cyclic code C_n and C_{n,1} equals 2^{ω(n)}.
citing papers explorer
-
Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
New SDP bounds for sum-rank-metric codes outperform prior bounds in experiments, with shown equivalences between Delsarte and eigenvalue LP bounds plus non-existence results for certain optimal codes.
-
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing
Provides an AMP-based asymptotic analysis of SLOPE, characterizing iterate dynamics via state evolution and proving asymptotic convergence to the SLOPE solution.
-
Meromorphic Quantum Computing
Projectivizing quantum kinematics produces meromorphic functions characterizing coherent circuits for quantum error correction and magic state distillation.
-
On the Euclidean duals of the cyclic codes generated via cyclotomic polynomials
The minimum distance of the Euclidean dual of each cyclic code C_n and C_{n,1} equals 2^{ω(n)}.