Sequential Decoding - The Computation Problem*
From MaRDI portal
Publication:5558352
DOI10.1002/J.1538-7305.1966.TB04210.XzbMATH Open0171.40302OpenAlexW1976797517MaRDI QIDQ5558352FDOQ5558352
Authors: John Savage
Publication date: 1966
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1966.tb04210.x
Recommendations
- scientific article; zbMATH DE number 4035733
- Sequential decoding based on an error criterion
- Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding
- Minimum distance estimates of the performance of sequential decoders
- Sequential decoding of convolutional codes in channels with intersymbol interference
Cited In (7)
- ARQ with Sequential Decoding of Packetized Data: Queueing Analysis
- Buffer overflow in variable length coding of fixed rate sources
- Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding
- Sequential decoding based on an error criterion
- Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
- The Coding of Internal States of Sequential Circuits
- On overflow and underflow problems in buffer-instrumented variable-length coding of fixed- rate memoryless sources (Corresp.)
This page was built for publication: Sequential Decoding - The Computation Problem*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558352)