Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Hamming Cube"”.

  1. Concentration of Measure and Ricci Curvature

    … of Measure inequality on the discrete Hamming cube, and discuss his extension of Ricci curvature to general metric spaces, particularly discrete metric measure spaces. We show that this “coarse” Ricci curvature on the Hamming cube is positive and present Ollivier's Concentration of …

    concordia Download PDF for Concentration of Measure and Ricci Curvature (opens in a new tab)

  2. Finitary Boolean functions

    We study functions on the infinite-dimensional Hamming cube (-1,1)**, in particu- lar Boolean functions into (-1,1), generalising results on analysis of Boolean functions on (-1,1); for n 2 N. The notion of noise sensitivity, first studied in [BKS99], is extended to this setting, and basic Fourier …

    chalmers Repository record for Finitary Boolean functions (opens in a new tab)

  3. On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems

    … as a new isoperimetric inequality of the Hamming cube. Using this inequality we prove integrality gap lower bounds for the Lovász-Schrijver SDP (resp. Sherali-Adams LP) relaxation of Vertex Cover (resp. Independent Set) in degree bounded graphs.

    toronto-retro Repository record for On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems (opens in a new tab)

  4. WEAK ISOMETRIES OF HAMMING SPACES

    In this thesis we study weak isometries of Hamming spaces. These are permutations of a Hamming space that preserve some but not necessarily all distances. We wish to find conditions under which a weak isometry is in fact an isometry. This type of problem was first posed by Beckman and Quarles for …

    mtu Repository record for WEAK ISOMETRIES OF HAMMING SPACES (opens in a new tab)

  5. Binary Frames, Codes and Euclidean Embeddings

    This dissertation has two parts. The first part is concerned with using Euclidean embeddings and random hyperplane tessellations to construct binary block codes. The construction proceeds in two stages. First, an auxiliary ternary code is chosen which consists of vectors in the union of coordinate …

    houston Repository record for Binary Frames, Codes and Euclidean Embeddings (opens in a new tab)