𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some lower bounds for constant weight codes

✍ Scribed by Iiro Honkala; Heikki Hämäläinen; Markku Kaikkonen

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
178 KB
Volume
18
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for constant degree indepen
Lower bounds for constant degree independent sets
✍ Michael O. Albertson; Debra L. Boutin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Let c(\* denote the maximum number of independent vertices all of which have the same degree. We provide lower bounds for G(\* for graphs that are planar, maximal planar, of bounded degree, or trees.

Lower bounds for Seshadri constants
Lower bounds for Seshadri constants
✍ Thomas Eckl 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract One of Demailly's characterization of Seshadri constants on ample line bundles works with Lelong numbers of certain positive singular hermitian metrics. In this note this is translated into algebraic terms by using sections of multiples of the line bundle. The resulting formula for Sesh

Lower bounds for codes correcting modera
Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration
✍ Sapna Jain; Ki-Bong Nam 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 110 KB

Lee weight is more appropriate for some practical situations than Hamming weight as it takes into account magnitude of each digit of the word. In this paper, considering Lee weight, we obtain necessary lower bound over the number of parity checks to correct bursts of length b (fixed) whose weight li