List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier. List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity. In Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006. pages 138-142, IEEE, 2006. [doi]

This author has not been identified. Look up 'Ilya Dumer' in GoogleThis author has not been identified. Look up 'Grigory Kabatiansky' in GoogleThis author has not been identified. Look up 'Cédric Tavernier' in Google

runs on WebDSL