An upper bound on the cutoff rate of sequential decoding

DOI10.1109/18.2601MaRDI QIDQ3792632zbMATH OpenOpenAlexFDO

Authors 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

cutoff ratediscrete memoryless channelslower boundsequential decodingupper bound

Mathematics Subject Classification ID

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

Recommendations

• Upper bounds on sequential decoding performance parameters
• A simple derivation of the lower bound to<tex>R_{mbox{comp}}</tex>for discrete memoryless channels (Corresp.)
• Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
• Channel combining and splitting for cutoff rate improvement
• Lower bounds to error probability for coding on discrete memoryless channels. I

Cited in

(5)

• Channel combining and splitting for cutoff rate improvement
• Upper bounds on sequential decoding performance parameters
• A simple derivation of the lower bound to<tex>R_{mbox{comp}}</tex>for discrete memoryless channels (Corresp.)
• 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)