#### Filter Results:

#### Publication Year

2003

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well-known that maximum likelihood decoding coincides with nearest neighbor decoding with respect to the Hamming metric on the binary symmetric channel. In this work we study channels and metrics for which those two criteria do and do not… (More)

—In this work we prove that a poset-block space admits a MacWilliams-type identity if and only if the poset is hierarchical and at any level of the poset, all the blocks have the same dimension. When the poset-block admits the MacWilliams-type identity we explicit the relation between the weight enumerators of a code and its dual.

—In this work we explore possibilities for coding when information worlds have different (semantic) values. We introduce a loss function that expresses the overall performance of a coding scheme for discrete channels and exchange the usual goal of minimizing the error probability to that of minimizing the expected loss. In this environment we explore the… (More)

—Until this work, the packing radius of a poset code was only known in the cases where the poset was a chain, a hierarchy, a union of disjoint chains of the same size, and for some families of codes. Our objective is to approach the general case of any poset. To do this, we will divide the problem into two parts. The first part consists in finding the… (More)

In this work we extend Wei's Duality Theorem, relating the generalized Hamming weight hierarchy of a code to the hierarchy of the dual code, to the scope of codes with poset metrics. As a consequence of this duality theorem we prove some results concerning discrepancy of codes and chain condition for generalized weights.