Upper Bounds on the Probability of the Correct Path Loss for List Decoding of Fixed Convolutional Codes

doi 10.1109/isit.1995.531512
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

IEEE

Related search

Bounds on the Maximum-Likelihood Decoding Error Probability of Low-Density Parity-Check Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2001English

Adaptive Decoding of Convolutional Codes

Advances in Radio Science
2007English

Generalized Feedback Decoding of Convolutional Codes

IEEE Transactions on Aerospace and Electronic Systems
Electronic EngineeringElectricalAerospace Engineering
1982English

List Decoding of Wavelet Codes

Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
Computational TheoryMathematics
2019English

Decoding of MDP Convolutional Codes Over the Erasure Channel

2009English

Bounds on the Performance of Sphere Decoding of Linear Block Codes

2005English

Analysis of Efficiency of the Bioinspired Method for Decoding Algebraic Convolutional Codes

EasternEuropean Journal of Enterprise Technologies
ControlElectronic EngineeringIndustrialMechanical EngineeringEnergy EngineeringApplied MathematicsSystems EngineeringManufacturing EngineeringComputer Science ApplicationsElectricalInnovationManagement of TechnologyPower Technology
2019English

On the Distribution of the Output Error Burst Lengths for Viterbi Decoding of Convolutional Codes

English

Soft Decisions for DQPSK Demodulation for the Viterbi Decoding of the Convolutional Codes

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy