𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On minimum distance bounds for abelian codes

✍ Scribed by Roberta Evans Sabin

Publisher
Springer
Year
1992
Tongue
English
Weight
818 KB
Volume
3
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 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

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