Academic Journal
Προβολή σε EDS

Universal Optimality of T-avoiding Spherical Codes and Designs.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Universal Optimality of T-avoiding Spherical Codes and Designs.
Συγγραφείς: Boyvalenkov, P. G.1 (AUTHOR) peter@math.bas.bg, Cherkashin, D. D.1 (AUTHOR) jiocb@math.bas.bg, Dragnev, P. D.2 (AUTHOR) dragnevp@pfw.edu
Πηγή: Constructive Approximation. Aug2026, Vol. 64 Issue 1, p145-182. 38p.
Θεματικοί όροι: *Lattice theory, *Regular graphs
Περίληψη: Given an open set T ⊂ [ - 1 , 1) , we introduce the concepts of T-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set T. We show that certain codes found in the minimal vectors of the Leech lattice, as well as the minimal vectors of the Barnes–Wall lattice and codes derived from strongly regular graphs, are universally optimal in the restricted class of T-avoiding codes. We also extend a result of Delsarte–Goethals–Seidel about codes with three inner products α , β , γ (in our terminology (α , β) -avoiding γ -codes). Parallel to the notion of tight spherical designs, we also derive that these codes are minimal (tight) T-avoiding spherical designs of fixed dimension and strength. In some cases, we also find that codes under consideration have maximal cardinality in their T-avoiding class for given dimension and minimum distance. [ABSTRACT FROM AUTHOR]
Βάση Δεδομένων: Academic Search Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://dx.doi.org/doi:10.1007/s00365-026-09759-2
    Name: EDS - Springer Nature Journals (s7799221)
    Category: fullText
    Text: View record at Springer
  – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:asx&genre=article&issn=01764276&ISBN=&volume=64&issue=1&date=20260801&spage=145&pages=145-182&title=Constructive Approximation&atitle=Universal%20Optimality%20of%20T-avoiding%20Spherical%20Codes%20and%20Designs.&aulast=Boyvalenkov%2C%20P.%20G.&id=DOI:10.1007/s00365-026-09759-2
    Name: Full Text Finder (for New FTF UI) (ns324271)
    Category: fullText
    Text: Full Text Finder
    MouseOverText: Full Text Finder
Header DbId: asx
DbLabel: Academic Search Index
An: 195873118
RelevancyScore: 1452
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1452.42456054688
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Universal Optimality of T-avoiding Spherical Codes and Designs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Boyvalenkov%2C+P%2E+G%2E%22">Boyvalenkov, P. G.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> peter@math.bas.bg</i><br /><searchLink fieldCode="AR" term="%22Cherkashin%2C+D%2E+D%2E%22">Cherkashin, D. D.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> jiocb@math.bas.bg</i><br /><searchLink fieldCode="AR" term="%22Dragnev%2C+P%2E+D%2E%22">Dragnev, P. D.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> dragnevp@pfw.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Constructive+Approximation%22">Constructive Approximation</searchLink>. Aug2026, Vol. 64 Issue 1, p145-182. 38p.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22Lattice+theory%22">Lattice theory</searchLink><br />*<searchLink fieldCode="DE" term="%22Regular+graphs%22">Regular graphs</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Given an open set T ⊂ [ - 1 , 1) , we introduce the concepts of T-avoiding spherical codes and designs, that is, spherical codes that have no inner products in the set T. We show that certain codes found in the minimal vectors of the Leech lattice, as well as the minimal vectors of the Barnes–Wall lattice and codes derived from strongly regular graphs, are universally optimal in the restricted class of T-avoiding codes. We also extend a result of Delsarte–Goethals–Seidel about codes with three inner products α , β , γ (in our terminology (α , β) -avoiding γ -codes). Parallel to the notion of tight spherical designs, we also derive that these codes are minimal (tight) T-avoiding spherical designs of fixed dimension and strength. In some cases, we also find that codes under consideration have maximal cardinality in their T-avoiding class for given dimension and minimum distance. [ABSTRACT FROM AUTHOR]
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asx&AN=195873118
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00365-026-09759-2
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 38
        StartPage: 145
    Subjects:
      – SubjectFull: Lattice theory
        Type: general
      – SubjectFull: Regular graphs
        Type: general
    Titles:
      – TitleFull: Universal Optimality of T-avoiding Spherical Codes and Designs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Boyvalenkov, P. G.
      – PersonEntity:
          Name:
            NameFull: Cherkashin, D. D.
      – PersonEntity:
          Name:
            NameFull: Dragnev, P. D.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 01764276
          Numbering:
            – Type: volume
              Value: 64
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Constructive Approximation
              Type: main
ResultId 1