𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new upper bound for binary codes with minimum distance four

✍ Scribed by Jun Kyo Kim; Sang Geun Hahn

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
134 KB
Volume
187
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of this paper is to give an upper bound for A [n,4], the maximum number of codewords in a binary code of length n with minimum distance d between codewords.

πŸ“œ SIMILAR VOLUMES

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 .

A new heuristic algorithm for finding mi
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
✍ Anna HaΔ‡; Kelei Zhou πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn