Bounds for binary codes relative to pseudo-distances of k points

DOI10.3934/AMC.2010.4.547zbMATH Open1213.94198OpenAlexW1994044538MaRDI QIDQ540397FDOQ540397

Christine Bachoc, Gilles Zémor

Publication date: 3 June 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2010.4.547

zbMATH Keywords

semidefinite programmingbinary codespseudo-distances

Mathematics Subject Classification ID

Semidefinite programming (90C22) Bounds on codes (94B65)

Cited In (2)

• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
• Invariant Semidefinite Programs

This page was built for publication: Bounds for binary codes relative to pseudo-distances of \(k\) points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540397)