Sequential decoding algorithm in a multiple-access channel
type: Item
instance of: scholarly article
title: Sequential decoding algorithm in a multiple-access channel
zbMATH Open document ID: 0613.94008
author: V. B. Balakirskij
published in: Problems of Information Transmission
publication date: 1985-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 94A40
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 3993448
zbMATH Keywords: sequential decoding algorithm
zbMATH Keywords: multiple-access channel
zbMATH Keywords: number of decoder calculations
zbMATH Keywords: Pareto distribution
zbMATH Keywords: decoding error probability
zbMATH Keywords: Viterbi algorithm
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 3993448