Book ChapterDOI
Procedures of Sequential Decoding
K. Sh. Zigangirov
- pp 109-130
Reads0
Chats0
TLDR
This course is devoted to the foundations of sequential decoding, first suggested by J. Wozencraft and essentially improved by American and Soviet scientists.Abstract:
This course is devoted to the foundations of sequential decoding. Sequential decoding was first suggested by J. Wozencraft [1]. Then it has been essentially improved by American and Soviet scientists.read more
Citations
More filters
Journal ArticleDOI
Subspaces of GF(q)ω and convolutional codes
TL;DR: As a conclusion it is obtained that for error-control purposes none of the investigated superclasses of the class of convolutional codes is better suited than theclass of convolutionsal codes itself.
Journal ArticleDOI
Improved error exponent for time-invariant and periodically time-variant convolutional codes
N. Shulman,Meir Feder +1 more
TL;DR: An improved upper bound on the error probability (first error event) of time-invariant convolutional codes, and the resulting error exponent, is derived, and an improved error exponent is derived.
Improved Error Exponent for Time-Invariant and
TL;DR: An improved upper bound on the error probability (first error event) of time-invariant convolutional codes, and the re- sulting error exponent, is derived and in the limit the error exponent equals the Yudkin-Viterbi exponent derived for time-variant convolutionsal codes.
Journal ArticleDOI
Some coding properties of speech
TL;DR: It can be argued that an optimal machine for automatic speech recognition should find robust the same cues which humans find robust, and the potential rate for words encoded in terms of independent distinctive features is closer to the subjective reliability of word perception than the rate for Words encoded by phonemes.
References
More filters
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI
Fast sequential decoding algorithm using a stack
TL;DR: A new sequential decoding algorithm is introduced that uses stack storage at the receiver that is much simpler to describe and analyze than the Fano algorithm, and is about six times faster than the latter at transmission rates equal to Rcomp.
Journal ArticleDOI
On the error probability of sequential decoding on the BSC
TL;DR: Upper bounds are derived on the error probability that can be achieved by using the maximum-likelihood algorithm of sequential decoding for the binary symmetric channel using constraint length and backsearch limit.