Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein. A bound for codes with given minimum and maximum distances. In Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006. pages 292-296, IEEE, 2006. [doi]
@inproceedings{HellesethKL06,
title = {A bound for codes with given minimum and maximum distances},
author = {Tor Helleseth and Torleiv Kløve and Vladimir I. Levenshtein},
year = {2006},
doi = {10.1109/ISIT.2006.261600},
url = {https://doi.org/10.1109/ISIT.2006.261600},
researchr = {https://researchr.org/publication/HellesethKL06},
cites = {0},
citedby = {0},
pages = {292-296},
booktitle = {Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006},
publisher = {IEEE},
isbn = {1-4244-0504-1},
}