geometric code

Two representatives are discussed primarily of decoding algorithms of algebraic geometric codes.

本文重点考察了代数几何码译码算法的两个典型代表———Ehrhard译码算法和大数表决方案 。

A new approach to the bounds of the minimum distance of Goppa geometry codes(algebraic-geometric codes) is presented.

引进一个关于Goppa几何码(代数几何码)最小距离界的一个新方法。

In this paper,we discuss a class of algebraic geometry codes (A-G codes) with good asymptotic parameters.

本文讨论了一类具有好的渐近参数的代数几何码。