✦ LIBER ✦

Two new bounds on the size of binary codes with a minimum distance of three

✍ Scribed by Yaron Klein; Simon Litsyn; Alexander Vardy

Publisher: Springer
Year: 1995
Tongue: English
Weight: 442 KB
Volume: 6
Category: Article
ISSN: 0925-1022
DOI: 10.1007/bf01388476

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Lower Bound on the Minimal Length

A New Lower Bound on the Minimal Length of a Binary Linear Code

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

Upper Bounds on the Covering Radius of a

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

✍ S. Litsyn; A. Tietäväinen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 235 KB

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 .

On the size of graphs labeled with a con

On the size of graphs labeled with a condition at distance two

✍ Georges, John P.; Mauro, David W. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 595 KB

A labeling of graph G with a condition at distance two is an integer labeling of V(G) such that adjacent vertices have labels that differ by at least two, and vertices distance two apart have labels that differ by a t least one. The lambda-number of G, A(G), is the minimum span over all labelings of

A note on the upper bound for the paired

A note on the upper bound for the paired-domination number of a graph with minimum degree at least two

✍ Shenwei Huang; Erfang Shan 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 70 KB 👁 1 views