DeepAI AI Chat
Log In Sign Up

On Bounds for Ring-Based Coding Theory

by   Niklas Gassner, et al.

Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical problems are related to this line of research. It has been well established, that with the generalization of the algebraic structure to rings there is a need to also generalize the underlying metric beyond the usual Hamming weight used in traditional coding theory over finite fields. This paper introduces a new weight, called the overweight, which can be seen as a generalization of the Lee weight on the integers modulo 4. For this new weight we provide a number of well-known bounds, like a Plotkin bound, a sphere-packing bound, and a Gilbert-Varshamov bound. A further highlight is the proof of a Johnson bound for the homogeneous weight on a general finite Frobenius ring.


page 1

page 2

page 3

page 4


On the Classification of Codes over Non-Unital Ring of Order 4

In the last 60 years coding theory has been studied a lot over finite fi...

Quaternions over Galois rings and their codes

It is shown in this paper that, if R is a Frobenius ring, then the quate...

Efficient Description of some Classes of Codes using Group Algebras

Circulant matrices are an important tool widely used in coding theory an...

Algebraic Geometry codes in the sum-rank metric

We introduce the first geometric construction of codes in the sum-rank m...

Harmonic Tutte polynomials of matroids II

In this work, we introduce the harmonic generalization of the m-tuple we...

The b-symbol weight distribution of irreducible cyclic codes and related consequences

The b-symbol read channel is motivated by the limitations of the reading...

Right Ideals of a Ring and Sublanguages of Science

Among Zellig Harris's numerous contributions to linguistics his theory o...