New Bounds for Codes Over Finite Frobenius Rings

Details New Bounds for Codes Over Finite Frobenius Rings New Bounds for Codes Over Finite Frobenius Rings

2009-05-08

arxiv.org/abs/0905.1313v1

Mathematics

Combinatorics

Scientific paper

We give results on the question of code optimality for linear codes over
finite Frobenius rings for the homogeneous weight. This article improves on the
existing Plotkin bound derived in an earlier paper, and suggests a version of a
Singleton bound. We also present some families of codes meeting these new
bounds.

Affiliated with

Also associated with

No associations

Rating

New Bounds for Codes Over Finite Frobenius Rings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Bounds for Codes Over Finite Frobenius Rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Bounds for Codes Over Finite Frobenius Rings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704082