✦ LIBER ✦

The covering radius of the cycle code of a graph

✍ Scribed by Patrick Solé; Thomas Zaslavsky

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 475 KB
Volume: 45
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90140-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The covering radius of Hadamard codes in

The covering radius of Hadamard codes in odd graphs

✍ Patrick Solé; Arif Ghafoor; Sohail A. Sheikh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 975 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

Maximality of the cycle code of a graph

✍ Patrick Solé; Thomas Zaslavsky 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 274 KB

The cycle code of a graph is the binary linear span of the characteristic vectors of circuits. We characterize the graphs whose cycle codes are maximal for the packing problem, based on characterizing the graphs whose girth is at least :(n-c)+ 1 where n and c are the numbers of vertices and connecte

A note on the covering radius of optimum

A note on the covering radius of optimum codes

✍ M.C. Bhandari; M.S. Garg 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 514 KB

On the covering radius of Reed—Solomon c

On the covering radius of Reed—Solomon codes

✍ Arne Dür 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB

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