Scribd Logo
Upload

Welcome to Scribd!

  • Pherical Code: Geometry Coding Theory Hypersphere Dot Product Kissing Number Problem Tammes Problem

    Uploaded by

    Fabricio Varovsky Muñiz Arteaga
    14 views1 page
    A spherical code is a set of points on a hypersphere where the dot product between any two points is less than or equal to some value t. The kissing number problem aims to find the maximum number of points N that can exist on a hypersphere of dimension n with a dot product threshold of 1/2. The Tammes problem seeks to find the minimum threshold t possible for a given number of points N on a hypersphere of dimension n.

    Original Description:

    m

    Original Title

    Code

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A spherical code is a set of points on a hypersphere where the dot product between any two points is less than or equal to some value t. The kissing number problem aims to find the maximum number of points N that can exist on a hypersphere of dimension n with a dot product threshold of 1/2. The Tammes problem seeks to find the minimum threshold t possible for a given number of points N on a hypersphere of dimension n.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    14 views1 page

    Pherical Code: Geometry Coding Theory Hypersphere Dot Product Kissing Number Problem Tammes Problem

    Uploaded by

    Fabricio Varovsky Muñiz Arteaga
    A spherical code is a set of points on a hypersphere where the dot product between any two points is less than or equal to some value t. The kissing number problem aims to find the maximum number of points N that can exist on a hypersphere of dimension n with a dot product threshold of 1/2. The Tammes problem seeks to find the minimum threshold t possible for a given number of points N on a hypersphere of dimension n.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    pherical code

    From Wikipedia, the free encyclopedia

    In geometry and coding theory, a spherical code with parameters (n,N,t) is a set of N points on the
    unit hypersphere in n dimensions for which the dot product of unit vectors from the origin to any two
    points is less than or equal to t. The kissing number problem may be stated as the problem of finding
    the maximal N for a given n for which a spherical code with parameters (n,N,1/2) exists.
    The Tammes problem may be stated as the problem of finding a spherical code with minimal t for
    given n and N.

    You might also like