✦ LIBER ✦

On Covering Radius and Discrete Chebyshev Polynomials

✍ Scribed by I. Honkala; T. Laihonen; S. Litsyn

Publisher: Springer
Year: 1997
Tongue: English
Weight: 222 KB
Volume: 8
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s002000050077

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Limit theorems for random walks on discr

Limit theorems for random walks on discrete semigroups related to nonhomogeneous trees and Chebyshev polynomials

✍ P. M. Soardi 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 French ⚖ 516 KB

On real and complex-valued bivariate Che

On real and complex-valued bivariate Chebyshev polynomials

✍ J.P Thiran; C Detaille 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 760 KB

On upper bounds for code distance and co

On upper bounds for code distance and covering radius of designs in polynomial metric spaces

✍ G Fazekas; V.I Levenshtein 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

On discrete scattering Hurwitz polynomia

On discrete scattering Hurwitz polynomials

✍ Alfred Fettweis; Sankar Basu 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 710 KB

On the covering radius of a code and its

On the covering radius of a code and its subcodes

✍ Richard A. Brualdi; Vera S. Pless 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 573 KB

On the covering radius of cyclic linear

On the covering radius of cyclic linear codes and arithmetic codes

✍ Tor Helleseth 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC