Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein. A coset weight count that proves that the simplex codes are not optimal for error correction. In Proceedings 2003 IEEE Information Theory Workshop, ITW 2003, La Sorbonne, Paris, France, 31 March - 4 April, 2003. pages 234-237, IEEE, 2003. [doi]
@inproceedings{HellesethKL03-0,
title = {A coset weight count that proves that the simplex codes are not optimal for error correction},
author = {Tor Helleseth and Torleiv Kløve and Vladimir I. Levenshtein},
year = {2003},
doi = {10.1109/ITW.2003.1216738},
url = {https://doi.org/10.1109/ITW.2003.1216738},
researchr = {https://researchr.org/publication/HellesethKL03-0},
cites = {0},
citedby = {0},
pages = {234-237},
booktitle = {Proceedings 2003 IEEE Information Theory Workshop, ITW 2003, La Sorbonne, Paris, France, 31 March - 4 April, 2003},
publisher = {IEEE},
isbn = {0-7803-7799-0},
}