Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
September 1, 1987IEEE Transactions on Information Theory

An updated table of minimum-distance bounds for binary linear codes

View Full Paper
Ask AI
Bookmark
Share

Discussion

Loading...

Member takes

Implication

Key Points

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

Cite This Study

A 1987 study studied this question.

synapsesocial.com/papers/6a8a8412fce154801ccbefb4https://doi.org/10.1109/tit.1987.1057356
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. 1Good block codes derived from cyclic codes1974 · 17 citations
  2. 2Error Correcting Codes1961 · 172 citations
  3. 3Further results on Goppa codes and their applications to constructing efficient binary codes1976 · 68 citations
  4. 4Shortened BCH codes (Corresp.)1973 · 40 citations
  5. 5New linear codes constructed by concatenating, extending, and shortening methods (Corresp.)1987 · 3 citations