CaltechAUTHORS: Article
https://feeds.library.caltech.edu/people/Welch-L-R/article.rss
A Caltech Library Repository Feedhttp://www.rssboard.org/rss-specificationpython-feedgenenTue, 23 Apr 2024 19:57:12 -0700A low-rate improvement on the Elias bound
https://resolver.caltech.edu/CaltechAUTHORS:WELieeetit74
Year: 1974
DOI: 10.1109/TIT.1974.1055279
An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound for R < 0.0509^+, is obtained. The new bound has the same derivative(-infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative-ln 2 at R = 0).https://resolver.caltech.edu/CaltechAUTHORS:WELieeetit74New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit77a
Year: 1977
DOI: 10.1109/TIT.1977.1055688
With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance. This upper bound is asymptotically less than Levenshtein's bound, and so also Elias's.https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit77a