An upper bound on the cutoff rate of sequential decoding

DOI10.1109/18.2601zbMATH Open0647.94020OpenAlexW2012050536MaRDI QIDQ3792632

Erdal Arikan

Publication date: 1988

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/26273

zbMATH Keywords

upper boundlower boundsequential decodingdiscrete memoryless channelscutoff rate

Mathematics Subject Classification ID

Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

Sequential Source Coding for Stochastic Systems Subject to Finite Rate Constraints ⋮ Moderate deviation principle for guesswork

This page was built for publication: An upper bound on the cutoff rate of sequential decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3792632)