The following pages link to (Q3250141):
Displaying 50 items.
- VC bounds on the cardinality of nearly orthogonal function classes (Q418881) (← links)
- The tensor product of two good codes is not necessarily robustly testable (Q436324) (← links)
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (Q686527) (← links)
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness (Q722765) (← links)
- Uniform recovery of fusion frame structured sparse signals (Q739459) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- On kissing numbers and spherical codes in high dimensions (Q1669035) (← links)
- Asymptotically good quasi-cyclic codes of fractional index (Q1685979) (← links)
- The weight distribution of quasi-quadratic residue codes (Q1783731) (← links)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (Q1802134) (← links)
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound (Q1802135) (← links)
- Strengthening the Gilbert-Varshamov bound (Q1973922) (← links)
- Self-orthogonal quasi-abelian codes are asymptotically good (Q2066385) (← links)
- Noisy beeping networks (Q2105415) (← links)
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \) (Q2107743) (← links)
- Density of free modules over finite chain rings (Q2158271) (← links)
- \( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good (Q2179519) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- The minimax learning rates of normal and Ising undirected graphical models (Q2192304) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- The clique distribution in powers of hypercubes (Q2235258) (← links)
- Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes (Q2302587) (← links)
- Nonparametric estimation of low rank matrix valued function (Q2326073) (← links)
- On the number of edges in a uniform hypergraph with a range of permitted intersections (Q2411798) (← links)
- Improved, black-box, non-malleable encryption from semantic security (Q2413015) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Minimax sparse principal subspace estimation in high dimensions (Q2443207) (← links)
- Entropy numbers of finite dimensional mixed-norm balls and function space embeddings with small mixed smoothness (Q2663135) (← links)
- Optimal function-on-scalar regression over complex domains (Q2683187) (← links)
- The diameter and connectivity of networks with random dependent faults (Q3057173) (← links)
- On the VC-Dimension of Binary Codes (Q4583427) (← links)
- What is known about unit cubes (Q4663501) (← links)
- Mixture decompositions of exponential families using a decomposition of their sample spaces (Q4917828) (← links)
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback (Q4978197) (← links)
- Construction of several classes of maximum codes (Q5063292) (← links)
- (Q5089160) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- (Q5092467) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- Quasi-quadratic residue codes and hyperelliptic curves (Q5236868) (← links)
- Discrepancy Theory and Quasi-Monte Carlo Integration (Q5264199) (← links)
- Limits to List Decoding Random Codes (Q5323045) (← links)
- Dimension of Marginals of Kronecker Product Models (Q5347296) (← links)
- (Q5857610) (← links)
- (Q5875528) (← links)
- Optimal Las Vegas reduction from one-way set reconciliation to error correction (Q5964019) (← links)
- A unification of the coding theory and OAQEC perspectives on hybrid codes (Q6049624) (← links)
- Hybrid decoding -- classical-quantum trade-offs for information set decoding (Q6111571) (← links)
