共查询到1条相似文献，搜索用时 0 毫秒
1.
Eimear Byrne Marcus Greferath Michael E. O’Sullivan 《Designs, Codes and Cryptography》2007,42(3):289-301
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.
An erratum to this article can be found at 相似文献