𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Codes with a poset metric

✍ Scribed by Richard A. Brualdi; Janine Smolin Graves; K.Mark Lawrence

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
742 KB
Volume
147
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Niederreiter generalized the following classical problem of coding theory: given a finite field F~ and integers n > k >~ 1, find the largest minimum distance achievable by a linear code over Fq of length n and dimension k. In this paper we place this problem in the more general setting of a partially ordered set and define what we call poset-codes. In this context, Niederreiter's setting may be viewed as the disjoint union of chains. We extend some of Niederreiter's bounds and also obtain bounds for posets which are the product of two chains.

πŸ“œ SIMILAR VOLUMES

On some perfect codes with respect to Le
On some perfect codes with respect to Lee metric
✍ Sapna Jain; Ki-Bong Nam; Ki-Suk Lee πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 226 KB

In this paper, we obtain bounds on the number of parity check digits for Lee weight codes correcting errors of Lee weight 1, errors of Lee weight 2 or less, errors of Lee weight 3 or less and errors of Lee weight 4 or less over Z q (q 5, a prime) respectively. We also examine these bounds with equal

A Gray Code for the Ideals of a Forest P
A Gray Code for the Ideals of a Forest Poset
✍ Y. Koda; F. Ruskey πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 707 KB

We present two algorithms for listing all the ideals of a forest poset. These algorithms generate ideals in a gray code manner; that is, consecutive ideals differ by exactly one element. Both algorithms use storage \(O(n)\), where \(n\) is the number of elements in the poset. On each iteration, the