The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The alphabet where is viewed here as a quotient of the ring of integers of by the ideal (3). Self-dual codes for the hermitian scalar product give -modular lattices by construction . There is a Gray map which maps self-dual codes for the Euclidean scalar product into Type III codes with a fixed point free involution in their automorphism group. Gleason type theorems for the symmetrized weight enumerators of Euclidean self-dual codes and the length weight enumerator of hermitian self-dual...
Let denote the minimum cardinality of a ternary code of length and covering radius one. In a previous paper, we improved on the lower bound by showing that . In this note, we prove that .
We apply Gromov’s ham sandwich method to get: (1) domain monotonicity (up to a multiplicative constant factor); (2) reverse domain monotonicity (up to a multiplicative constant factor); and (3) universal inequalities for Neumann eigenvalues of the Laplacian on bounded convex domains in Euclidean space.
We prove a Chevet type inequality which gives an upper bound for the norm of an isotropic log-concave unconditional random matrix in terms of the expectation of the supremum of “symmetric exponential” processes, compared to the Gaussian ones in the Chevet inequality. This is used to give a sharp upper estimate for a quantity that controls uniformly the Euclidean operator norm of the submatrices with k rows and m columns of an isotropic log-concave unconditional random matrix. We apply these estimates...
Currently displaying 1 –
12 of
12