Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound

Can Xiang, Cunsheng Ding, Sihem Mesnager. Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound. IEEE Transactions on Information Theory, 61(12):6526-6535, 2015. [doi]

Authors

Can Xiang

This author has not been identified. Look up 'Can Xiang' in Google

Cunsheng Ding

This author has not been identified. Look up 'Cunsheng Ding' in Google

Sihem Mesnager

This author has not been identified. Look up 'Sihem Mesnager' in Google