scientific article
From MaRDI portal
Publication:3250141
zbMath0081.36905MaRDI QIDQ3250141
Publication date: 1957
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (56)
Construction of several classes of maximum codes ⋮ Density of free modules over finite chain rings ⋮ Limits to List Decoding Random Codes ⋮ On kissing numbers and spherical codes in high dimensions ⋮ Entropy numbers of finite dimensional mixed-norm balls and function space embeddings with small mixed smoothness ⋮ \( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ On the VC-Dimension of Binary Codes ⋮ Algebraic theory of block codes detecting independent errors ⋮ Unnamed Item ⋮ Dimension of Marginals of Kronecker Product Models ⋮ Asymptotically good quasi-cyclic codes of fractional index ⋮ A unification of the coding theory and OAQEC perspectives on hybrid codes ⋮ A new coding-based algorithm for finding closest pair of vectors ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ The minimax learning rates of normal and Ising undirected graphical models ⋮ Hybrid decoding -- classical-quantum trade-offs for information set decoding ⋮ Optimal function-on-scalar regression over complex domains ⋮ Densities of codes of various linearity degrees in translation-invariant metric spaces ⋮ Hermitian self-dual 2-quasi-abelian codes ⋮ VC bounds on the cardinality of nearly orthogonal function classes ⋮ Asymptotically good \(\mathbb{Z}_p\mathbb{Z}_p[u/\langle u^t\rangle\)-additive cyclic codes] ⋮ Orion: zero knowledge proof with linear prover time ⋮ Unnamed Item ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ Indistinguishability obfuscation ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ The tensor product of two good codes is not necessarily robustly testable ⋮ Minimax sparse principal subspace estimation in high dimensions ⋮ Speeding-up verification of digital signatures ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Strengthening the Gilbert-Varshamov bound ⋮ The clique distribution in powers of hypercubes ⋮ Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) ⋮ What is known about unit cubes ⋮ Unnamed Item ⋮ The diameter and connectivity of networks with random dependent faults ⋮ The weight distribution of quasi-quadratic residue codes ⋮ Unnamed Item ⋮ Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness ⋮ Optimal Las Vegas reduction from one-way set reconciliation to error correction ⋮ Uniform recovery of fusion frame structured sparse signals ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound] ⋮ Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ Capacity of Interactive Communication over Erasure Channels and Channels with Feedback ⋮ Self-orthogonal quasi-abelian codes are asymptotically good ⋮ Quasi-quadratic residue codes and hyperelliptic curves ⋮ Cryptography with constant input locality ⋮ Nonparametric estimation of low rank matrix valued function ⋮ Mixture decompositions of exponential families using a decomposition of their sample spaces ⋮ Noisy beeping networks ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration ⋮ Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
This page was built for publication:
