A bound for codes with given minimum and maximum distances - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Tor Helleseth' in GoogleThis author has not been identified. Look up 'Torleiv Kløve' in GoogleThis author has not been identified. Look up 'Vladimir I. Levenshtein' in Google

runs on WebDSL