𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The covering radius of Hadamard codes in odd graphs

✍ Scribed by Patrick Solé; Arif Ghafoor; Sohail A. Sheikh

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
975 KB
Volume
37-38
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the covering radius of Reed-Muller co
On the covering radius of Reed-Muller codes
✍ Gérard D. Cohen; Simon N. Litsyn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 371 KB

We present lower and upper bounds on the covering radius of Reed-Muller codes, yielding asymptotical improvements on known results. The lower bound is simply the sphere covering one (not very new). The upper bound is derived from a thorough use of a lemma, the 'essence of Reed-Mullerity'. The idea

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