Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 1, 1993IEEE Transactions on Information Theory

Bounds on the trellis size of linear block codes

View Full Paper
Ask AI
Bookmark
Share

Authors

YBYaniv BergerTel Aviv UniversityYBY. 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

Berger et al. (1993) studied this question.

synapsesocial.com/papers/6a8a7b71f8670bac6e337ad2https://doi.org/10.1109/18.179359
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. 1Minimal trellises for block codes1988 · 216 citations
  2. 2Shortened BCH codes (Corresp.)1973 · 39 citations
  3. 3Coset codes. II. Binary lattices and related codes1988 · 664 citations
  4. 4Efficient maximum likelihood decoding of linear block codes using a trellis1978 · 569 citations
  5. 5Optimal soft decision block decoders based on fast Hadamard transform1986 · 100 citations