一类新的能够渐进达到 Gilbert-Varshamov 界的Alternant 子类码

摘要

A new subclass of binary Alternant codes is proposed based on the Hamming weight distribution of Maximum Distance Separable(MDS)codes.It is shown that the new codes include the whole BCH codes subclass and can asymptotically meet the Gilbert-Varshamov(GV)bound.%本文基于 Maximum Distance Separable（MDS）码的 Hamming 重量分布提出一类新的二元 Alternant 子类码。分析表明这类新的子类码包含整个 BCH 码类，并且可以渐进达到 Gilbert-Varshamov（GV）界。