New approaches to reduced-complexity decoding
From MaRDI portal
Publication:1180151
DOI10.1016/0166-218X(91)90107-8zbMath0736.94014OpenAlexW2093403978MaRDI QIDQ1180151
John T. Coffey, Rodney M. Goodman, Patrick 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
cyclic codesGilbert-Varshamov boundsoft decodingasymptotic complexitydecoding complexitydecoding general linear codeshard decoding
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of decoding for linear codes
- Lower asymptotic bound on the number of linear code words in a sphere of given radius in \(F_ q^ n\).
- An error-trapping decoder for nonbinary cyclic codes (Corresp.)
- A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
- Capability of the error-trapping technique in decoding cyclic codes
- Decoding linear block codes for minimizing word error rate (Corresp.)
- On vote-taking and complete decoding of certain error-correcting codes
- On complete decoding of linear error-correcting codes
- The complexity of information set decoding
- Efficient maximum likelihood decoding of linear block codes using a trellis
- On the inherent intractability of certain coding problems (Corresp.)
- A Generalization of Difference Sets
- A coding theorem for time-discrete analog data sources
- Limit distribution of the minimum distance of random linear codes
- Class of algorithms for decoding block codes with channel measurement information
- Permutation decoding of certain triple-error-correcting binary codes (Corresp.)
- A decoding procedure for multiple-error-correcting cyclic codes
- Permutation Decoding of Systematic Codes
This page was built for publication: New approaches to reduced-complexity decoding
