𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance

✍ Scribed by S. Litsyn; A. Tietäväinen

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
235 KB
Volume
17
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole ´ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta ¨ va ¨ inen's bound .

📜 SIMILAR VOLUMES

A lower bound on the order of regular gr
A lower bound on the order of regular graphs with given girth pair
✍ C. Balbuena; T. Jiang; Y. Lin; X. Marcote; M. Miller 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kovács [Regular graphs with given girth pair, J Graph Theory 7 (1983), 209–218]. A (δ, __g__)‐cage is a small

Sex and sex worship. (Phallic Worship.)
Sex and sex worship. (Phallic Worship.) A scientific treatise on sex, its nature and function, and its influence on art, science, architecture, literature and religion‐with special reference to sex worship and symbolism. By O. A. Wall, M.D., Ph.G., Ph.M. 625 pages, 6 3/4 × 9 3/4, with 375 beautiful illustrations, including halftones and line drawings, from one of the largest collections in the world on the subject. Beautifully printed on special sepia paper and bound in blue silk cloth with gold stamping on front cover and backbone. Price, postpaid, $7.50
📂 Article 📅 1919 🏛 Elsevier ⚖ 103 KB