Bounds for binary codes relative to pseudo-distances of k points
classification
💻 cs.IT
math.IT
keywords
binaryboundscodesapplydecodingdistancesgeneralizedimproved
read the original abstract
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.