Back to Search Start Over

The linear programming bound for codes over finite Frobenius rings

Authors :
Marcus Greferath
Eimear Byrne
Michael E. O'Sullivan
Source :
Designs, Codes and Cryptography. 42
Publication Year :
2007
Publisher :
Springer Science and Business Media LLC, 2007.

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.

Subjects

Subjects :
Discrete mathematics
Block code
Linear programming
business.industry
Applied Mathematics
Singleton bound
Cryptography
Coding theory
Linear code
Computer Science Applications
Algebra
Group code
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
business
Mathematics

Details

ISSN :
15737586 and 09251022
Volume :
42
Database :
OpenAIRE
Journal :
Designs, Codes and Cryptography
Accession number :
edsair.doi...........523175382f4666a0b5b01b52d851ccc6

Tools

Authors Abstract Subjects Details