| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7646009 (Why is no real title available?) | 2023-01-25 | Paper |
| scientific article; zbMATH DE number 3804897 (Why is no real title available?) | 1982-01-01 | Paper |
Design of a linguistic statistical decoder for the recognition of continuous speech
IEEE Transactions on Information Theory | 1975-01-01 | Paper |
Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition
IEEE Transactions on Information Theory | 1975-01-01 | Paper |
Bootstrap trellis decoding
IEEE Transactions on Information Theory | 1975-01-01 | Paper |
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
Upper bounds on sequential decoding performance parameters
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
Variable-length encoding of fixed-rate Markov sources for fixed-rate channels
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
Tree encoding of Gaussian sources
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
A 2-cycle algorithm for source coding with a fidelity criterion
IEEE Transactions on Information Theory | 1973-01-01 | Paper |
Permutation codes for sources
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
On variable-length-to-block coding
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
On the structure of rate<tex>1/n</tex>convolutional codes
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
An efficient algorithm for computing free distance (Corresp.)
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
Instrumentable tree encoding of information sources (Corresp.)
IEEE Transactions on Information Theory | 1971-01-01 | Paper |
Rate 1/2 convolutional codes with complementary generators
IEEE Transactions on Information Theory | 1971-01-01 | Paper |
Bootstrap hybrid decoding for symmetrical binary input channels
Information and Control | 1971-01-01 | Paper |
Tree encoding of memoryless time-discrete sources with a fidelity criterion
IEEE Transactions on Information Theory | 1969-01-01 | Paper |
An upper bound on moments of sequential decoding effort
IEEE Transactions on Information Theory | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3278949 (Why is no real title available?) | 1968-01-01 | Paper |
Buffer overflow in variable length coding of fixed rate sources
IEEE Transactions on Information Theory | 1968-01-01 | Paper |
Evaluation of expurgated bound exponents
IEEE Transactions on Information Theory | 1968-01-01 | Paper |
Determination of capacity achieving input probabilities for a class of finite state channels with side information
Information and Control | 1966-01-01 | Paper |
Indecomposable channels with side information at the transmitter
Information and Control | 1965-01-01 | Paper |
Coding for and decomposition of two-way channels
IEEE Transactions on Information Theory | 1964-01-01 | Paper |
Loss in information transmission through two-way channels
Information and Control | 1963-01-01 | Paper |
