scientific article; zbMATH DE number 4035733
From MaRDI portal
Publication:3775474
zbMATH Open0635.94017MaRDI QIDQ3775474FDOQ3775474
Authors: V. B. Balakirskij 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- Minimum distance estimates of the performance of sequential decoders
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Mathematical analysis of algebraic sequential coding
- scientific article; zbMATH DE number 820517
- Sequential decoding of convolutional codes in channels with intersymbol interference
decoding complexityFano's algorithm with variable thresholdslinear convolutional codessequential decoding algorithm
Cited In (17)
- Sequential decoding of convolutional codes in channels with intersymbol interference
- Coding and decoding for time-discrete amplitude-continuous memoryless channels
- Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding
- Upper bounds on sequential decoding performance parameters
- Linear systems analysis and decoding of convolutional codes
- Title not available (Why is that?)
- On the complexity of bounded distance decoding for the AWGN channel
- Title not available (Why is that?)
- Sequential decoding with trellis shaping
- On low complexity stack decoding of convolutional codes
- Sequential Decoding - The Computation Problem*
- Sequential decoding algorithm in a multiple-access channel
- Mathematical analysis of algebraic sequential coding
- Decoding a perturbed sequence generated by an LFSR
- Minimum distance estimates of the performance of sequential decoders
- Generalized threshold decoding of convolutional codes
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775474)
