Unique optima of the Delsarte linear program

DOI10.1007/s10623-023-01191-yzbMath1528.94121arXiv2204.06090OpenAlexW4318425230MaRDI QIDQ6045526

Rupert Li

Publication date: 31 May 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.06090

zbMATH Keywords

Krawtchouk polynomialscoding theorycodeslinear programming boundDelsarte linear programquasicode

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Bounds on codes (94B65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zeros of generalized Krawtchouk polynomials
• Designs as maximum codes in polynomial metric spaces
• The sphere packing problem in dimension 8
• The sphere packing problem in dimension \(24\)
• A proof of the Kepler conjecture
• Error Detecting and Error Correcting Codes
• New Bounds for Hahn and Krawtchouk Polynomials
• Spherically Punctured Biorthogonal Codes

This page was built for publication: Unique optima of the Delsarte linear program