Sequential decoding algorithm in a multiple-access channel

MaRDI QIDQ1820128zbMATH OpenFDO

Authors V. B. Balakirskij

Publication date 1985

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

decoding error probabilitymultiple-access channelnumber of decoder calculationsPareto distributionsequential decoding algorithmViterbi algorithm

Mathematics Subject Classification ID

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

Review text

The article describes a sequential decoding algorithm in a multiple- access channel. An upper bound is obtained for the distribution of the number of decoder calculations; this bound has the form of a Pareto distribution. It is shown that, at transmission rates greater than the computing rates, sequential decoding in a multiple-access channel can provide better exchange relations between the complexity and decoding error probability than the Viterbi algorithm.

Recommendations

• An upper bound on the distribution of computation of a sequential decoder for multiple-access channels
• Sequential decoding for multiple access channels
• scientific article; zbMATH DE number 3463521
• scientific article; zbMATH DE number 4035733
• On the achievable rate region of sequential decoding for a class of multiaccess channels

Cited in

(13)

• Comparative analysis of sequential decoding algorithms
• Sequential decoding of convolutional codes in channels with intersymbol interference
• A bidirectional multiple stack algorithm
• On the achievable rate region of sequential decoding for a class of multiaccess channels
• ARQ with Sequential Decoding of Packetized Data: Queueing Analysis
• Sequential decoding for multiple access channels
• scientific article; zbMATH DE number 3463521 (Why is no real title available?)
• scientific article; zbMATH DE number 3463522 (Why is no real title available?)
• Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel
• Sequential decoding with trellis shaping
• An upper bound on the distribution of computation of a sequential decoder for multiple-access channels
• Search properties of some sequential decoding algorithms
• scientific article; zbMATH DE number 3412514 (Why is no real title available?)

This page was built for publication: Sequential decoding algorithm in a multiple-access channel

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