A coset weight count that proves that the simplex codes are not optimal for error correction

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]

Abstract

Abstract is missing.