Navigation Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 par Discipline "Informatique [cs]/Théorie de l'information [cs.IT]"
Voici les éléments 41-60 de 82
-
A construction of quantum LDPC codes from Cayley graphs
(IEEE Transactions on Information Theory. vol. 59, n° 9, pp. 6087-6098, 2013-09)Article de revue -
On Bounded Weight Codes
(IEEE Transactions on Information Theory. vol. 57, n° 10, pp. 6780-6787, 2011)Article de revue -
Signal reconstruction from the magnitude of subspace components
(2013)Document de travail - Pré-publication -
Upper bounds on the Rate of Low Density Stabilizer Codes for the Quantum Erasure Channel
(Quantum Information & Computation. vol. 13, n° 9&10, pp. 0793--0826, 2013)Article de revue -
High-order Masking by Using Coding Theory and Its Application to AES
Communication dans un congrès -
Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength
(IEEE Transactions on Information Theory. vol. 60, n° 2, pp. 1193-1202, 2014)Article de revue -
Batch-less stochastic gradient descent for compressive learning of deep regularization for image denoising
Document de travail - Pré-publication -
On strong basins of attractions for non-convex sparse spike estimation: upper and lower bounds
(Journal of Mathematical Imaging and Vision, 2023-09-28)Article de revue -
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
Communication dans un congrès -
The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
(Inverse Problems, 2020-02-21)Article de revue -
Constructions of Grassmannian Simplices
Document de travail - Pré-publication -
Linear programming bounds for unitary space time codes
Document de travail - Pré-publication -
Optimal Iris Fuzzy Sketches
Communication dans un congrès -
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
(2007-10-05)Document de travail - Pré-publication -
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
(European Journal of Combinatorics. vol. 30, n° 3, pp. 625-637, 2009-04)Article de revue -
Optimality and uniqueness of the (4,10,1/6) spherical code
(Journal of Combinatorial Theory, Series A. vol. 116, pp. 195-204, 2009-01)Article de revue -
Linear programming bounds for codes in Grassmannian spaces
(IEEE Transactions on Information Theory. vol. 52, n° 5, pp. 2111-2125, 2006)Article de revue -
Regularized Optimal Transport and the ROT Mover's Distance
(Journal of Machine Learning Research, 2018)Article de revue -
Quantum Information Set Decoding Algorithms
Communication dans un congrès -
Is the 1-norm the best convex sparse regularization?
Communication dans un congrès