Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
March 1, 1994IEEE Transactions on Information Theory

Maximum-likelihood soft decision decoding of BCH codes

View Full Paper
Ask AI
Bookmark
Share

Authors

AVAlexander VardyUniversity of California, San DiegoYBY. Be'eryTel Aviv University

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Vardy et al. (1994) studied this question.

synapsesocial.com/papers/6a8a8412fce154801ccbefb2https://doi.org/10.1109/18.312184
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1An updated table of minimum-distance bounds for binary linear codes1987 · 289 citations
  2. 2Efficient maximum likelihood decoding of linear block codes using a trellis1978 · 569 citations
  3. 3On the generalized Hamming weights of several classes of cyclic cods1992 · 72 citations
  4. 4Bounds on the trellis size of linear block codes1993 · 46 citations
  5. 5Optimal soft decision block decoders based on fast Hadamard transform1986 · 100 citations