Semidefinite Programming Bounds for Constant-Weight Codes

@article{Polak2019SemidefinitePB,
  title={Semidefinite Programming Bounds for Constant-Weight Codes},
  author={Sven Polak},
  journal={IEEE Transactions on Information Theory},
  year={2019},
  volume={65},
  pages={28-38}
}
For nonnegative integers <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">$d$ </tex-math></inline-formula>, and <inline-formula> <tex-math notation="LaTeX">$w$ </tex-math></inline-formula>, let <inline-formula> <tex-math notation="LaTeX">$A(n,d,w)$ </tex-math></inline-formula> be the maximum size of a code <inline-formula> <tex-math notation="LaTeX">$C \subseteq \mathbb {F}_{2}^{n}$ </tex-math></inline-formula> with a… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations