Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channel.

Po-Ning Chen Hsuan-Yin Lin Stefan M. Moser

Published in: ISIT (2013)

Keyphrases

worst case
lower bound
optimal solution
upper bound
closed form
error correcting
error correcting codes
optimal cost
dynamic programming
multi channel
error correction
asymptotically optimal
error control
estimation error
meeting room
provide an upper bound