✦ LIBER ✦

Upper bounds on the minimum distance of spherical codes

✍ Scribed by Boyvalenkov, P.G.; Danev, D.P.; Bumova, S.P.

Book ID: 111931795
Publisher: IEEE
Year: 1996
Tongue: English
Weight: 591 KB
Volume: 42
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.532903

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On minimum distance bounds for abelian c

On minimum distance bounds for abelian codes

✍ Roberta Evans Sabin 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 818 KB

On Upper Bounds for Minimum Distance and

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

✍ Tero Laihonen; Simon Litsyn 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 329 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.

Bounds on Minimum Distance for Linear Co

Bounds on Minimum Distance for Linear Codes over GF(5)

✍ Rumen N. Daskalov; T. Aaron Gulliver 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 56 KB

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

Bounds on the Minimum Distance of High D

Bounds on the Minimum Distance of High Dimensional Circular Trellis-Coded Modulation

✍ Xiangyu Song; Jeffrey Dill; Alan R. Lindsey 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

This paper derives the upper and lower bounds on the minimum distance of 4-ary circular trellis-coded modulation using a simplex signal constellation. The bounds are shown to be tight and reachable, and the code is shown to achieve simplex distance between parallel paths at each stage of the trellis