On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Leonid A. Bassalygo, Stefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev. On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound. In Gadiel Seroussi, Alfredo Viola, editors, 2006 IEEE Information Theory Workshop, ITW 2006, Punta del Este, Uruguay, March 13-17, 2006. pages 278-282, IEEE, 2006. [doi]

This author has not been identified. Look up 'Leonid A. Bassalygo' in GoogleThis author has not been identified. Look up 'Stefan M. Dodunekov' in GoogleThis author has not been identified. Look up 'Tor Helleseth' in GoogleThis author has not been identified. Look up 'Victor A. Zinoviev' in Google

runs on WebDSL