The linear programming bound for codes over finite Frobenius rings

Eimear Byrne, Marcus Greferath, Michael E. O'Sullivan

Research output: Contribution to journalArticleScientificpeer-review

18 Citations (Scopus)

Abstract

In traditional algebraic coding theory the linear-programming bound is one of the most powerful and restrictive bounds for the existence of both linear and non-linear codes. This article develops a linear-programming bound for block codes on finite Frobenius rings.
Original languageUndefined/Unknown
Pages (from-to)289-301
Number of pages13
JournalDESIGNS CODES AND CRYPTOGRAPHY
Volume42
Issue number3
DOIs
Publication statusPublished - 2007
MoE publication typeA1 Journal article-refereed

Keywords

  • codes over rings
  • finite Frobenius rings
  • homogeneous weights
  • linear-programming bound

Cite this