Abstract
Here we consider two problems: the problem of almost optimal decoding and the decoding that corrects the number of errors asymptotically equal to the half distance of the codes whose parameters asymptotically attain the Varshamov-Gilbert bound. By the complexity we mean the maximal number of arithmetic operations necessary for reconstructing a codevector by using the vector which is the output of the channel.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blinovsky, V. (1997). Decoding Complexity. In: Asymptotic Combinatorial Coding Theory. The Springer International Series in Engineering and Computer Science, vol 415. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6193-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6193-4_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7839-6
Online ISBN: 978-1-4615-6193-4
eBook Packages: Springer Book Archive