The linear programming bound for codes over finite Frobenius rings

Authors:
Eimear Byrne;Marcus Greferath;Michael E. O'Sullivan
Affiliations:
School of Mathematical Sciences, University College Dublin, Dublin 4, Ireland;School of Mathematical Sciences, University College Dublin, Dublin 4, Ireland;Department of Mathematics and Statistics, San Diego State University, San Diego, USA 92182-7720
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 8
Cited 0

The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Finite-ring combinatorics and MacWilliams' equivalence theorem

Journal of Combinatorial Theory Series A
On the optimal Z4 codes of type II and length 16

Journal of Combinatorial Theory Series A
Fourier-invariant pairs of partitions of finite abelian groups and association schemes

Problems of Information Transmission
Z2k-linear codes

IEEE Transactions on Information Theory
On the isometries between Z(pk) and Z pk

IEEE Transactions on Information Theory
Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code

IEEE Transactions on Information Theory
A Z8-linear lift of the binary Golay code and a nonlinear binary (96,237,24)-code

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.02

Visualization

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.