New approaches to reduced-complexity decoding

DOI10.1016/0166-218X(91)90107-8MaRDI QIDQ1180151zbMATH OpenOpenAlexFDO

Authors John T. Coffey, Rodney M. Goodman, P. G. Farrell

Publication date 27 June 1992

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

Full work available at URL https://doi.org/10.1016/0166-218x(91)90107-8

zbMATH Keywords

cyclic codesGilbert-Varshamov boundsoft decodingasymptotic complexitydecoding complexitydecoding general linear codeshard decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Low-Complexity Decoding via Reduced Dimension Maximum-Likelihood Search
• New approach to estimation of the decoding error probability
• A New Algorithm for Decoding Reed-Solomon Codes
• Decoding of low-density codes
• Reduced-complexity trellises for the joint source-channel decoding of variable-length encoded data
• Two new decoding algorithms for Reed-Solomon codes
• A reduced-complexity algorithm for combined equalization and decoding
• scientific article; zbMATH DE number 4216926
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• scientific article; zbMATH DE number 1293741

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3616338 (Why is no real title available?)
• scientific article; zbMATH DE number 3307993 (Why is no real title available?)
• A Generalization of Difference Sets
• A coding theorem for time-discrete analog data sources
• A decoding procedure for multiple-error-correcting cyclic codes
• A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
• An error-trapping decoder for nonbinary cyclic codes (Corresp.)
• Capability of the error-trapping technique in decoding cyclic codes
• Class of algorithms for decoding block codes with channel measurement information
• Complexity of decoding for linear codes
• Decoding linear block codes for minimizing word error rate (Corresp.)
• Efficient maximum likelihood decoding of linear block codes using a trellis
• Limit distribution of the minimum distance of random linear codes
• Lower asymptotic bound on the number of linear code words in a sphere of given radius in \(F_ q^ n\).
• On complete decoding of linear error-correcting codes
• On the inherent intractability of certain coding problems (Corresp.)
• On vote-taking and complete decoding of certain error-correcting codes
• Permutation Decoding of Systematic Codes
• Permutation decoding of certain triple-error-correcting binary codes (Corresp.)
• The complexity of information set decoding

Cited in

(5)

• FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
• Statistical decoding 2.0: reducing decoding to LPN
• New approach to estimation of the decoding error probability
• Some Current Research in Decoding Theory
• Box and Match Techniques Applied to Soft-Decision Decoding

Describes a project that uses

Uses Software

• McEliece

This page was built for publication: New approaches to reduced-complexity decoding

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