✦ LIBER ✦

On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes

✍ Scribed by Tero Laihonen; Simon Litsyn

Book ID: 110260939
Publisher: Springer
Year: 1998
Tongue: English
Weight: 329 KB
Volume: 14
Category: Article
ISSN: 0925-1022
DOI: 10.1023/a:1008260505585

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds on the minimum distance of

Upper bounds on the minimum distance of spherical codes

✍ Boyvalenkov, P.G.; Danev, D.P.; Bumova, S.P. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 591 KB

A new upper bound for binary codes with

A new upper bound for binary codes with minimum distance four

✍ Jun Kyo Kim; Sang Geun Hahn 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 134 KB

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.

On upper bounds for code distance and co

On upper bounds for code distance and covering radius of designs in polynomial metric spaces

✍ G Fazekas; V.I Levenshtein 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1015 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 .

Binary and ternary codes of covering rad

Binary and ternary codes of covering radius one: some new lower bounds

✍ Wolfgang Haas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 128 KB

On the Minimum Distances of Non-Binary C

On the Minimum Distances of Non-Binary Cyclic Codes

✍ Pascale Charpin; Aimo Tietäväinen; Victor Zinoviev 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 33 KB