On the complexity of suboptimal decoding for list and decision feedback schemes

DOI10.1016/J.DAM.2005.03.023zbMATH Open1089.94043DBLPjournals/dam/FreudenbergerZ06OpenAlexW2055651006WikidataQ59329670 ScholiaQ59329670MaRDI QIDQ2489924FDOQ2489924

Authors: Jürgen Freudenberger, V. V. Zyablov 

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.023

Recommendations

• Suboptimal decoding of linear codes: partition technique
• scientific article; zbMATH DE number 493106
• List decoding
• List decoding in a Gaussian channel
• List decoding of convolutional codes

zbMATH Keywords

Bounded distance decodingList decodingDecision feedbackDecoding complexityError exponent

Mathematics Subject Classification ID

Decoding (94B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A simple derivation of the coding theorem and some applications
• Title not available (Why is that?)
• Exponential error bounds for erasure, list, and decision feedback schemes
• On the complexity of minimum distance decoding of long linear codes
• The complexity of information set decoding
• Two decoding algorithms for linear codes
• Complexity of decoding for linear codes
• Maximum-likelihood list decoding using trellises
• Bounds on complexity of trellis decoding of linear block codes
• Lower bounds on trellis complexity of block codes
• List and soft symbol output Viterbi algorithms: Extensions and comparisons
• Suboptimal decoding of linear codes: partition technique
• Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule

Cited In (2)

• Optimal Rate List Decoding via Derivative Codes
• Seminoisy deterministic multiple-access channels: coding theorems for list codes and codes with feedback

This page was built for publication: On the complexity of suboptimal decoding for list and decision feedback schemes

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