@inproceedings{91fcecbc66d744cf9478596fc030e051,
title = "On the VC-dimension of binary codes",
abstract = "We investigate the asymptotic rates of length-n binary codes with VC-dimension at most dn and minimum distance at least δn. Two upper bounds are obtained, one as a simple corollary of a result by Haussler and the other via a shortening approach combining Sauer-Shelah lemma and the linear programming bound. Two lower bounds are given using Gilbert-Varshamov type arguments over constant-weight and Markov-type sets.",
author = "Sihuang Hu and Nir Weinberger and Ofer Shayevitz",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",
year = "2017",
month = aug,
day = "9",
doi = "10.1109/ISIT.2017.8006597",
language = "الإنجليزيّة",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "594--598",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
address = "الولايات المتّحدة",
}