Decoding method for generalized algebraic geometry codes
Ryutaroh Matsumoto, Masakuni Oishi
Abstract
We propose a decoding method for the generalized algebraic geometry codes proposed by Xing et al. To show its practical usefulness, we give an example of generalized algebraic geometry codes of length 567 over F8 whose numbers of correctable errors by the proposed method are larger than the shortened codes of the primitive BCH codes of length 4095 in the most range of dimension.
Create a lesson
Related papers
An Infinite Family of Apéry-like Recurrences for Euler's Constant
Rotem Kalisch, Tali Monderer, Elyasheev Leibtag et al.
On the saturability of p-adic Lie groups
Casey Perdue
On Divisor Function Polynomials and Dirichlet Series
Martin N. Huxley, Matthew C. Lettington, Karl Michael Schmidt
On a conjecture on Romanoff type representations
Xiao-Hui Yan
Regularization of a Divergent Arithmetic Product via the Asymptotic Monoid: The Case of (-1)ω(n)
A. Alvarez Cruz, E. A. Alvarez Gutierrez
Appell Sequences in Analytic Number Theory: Shifted Expansions and Dirichlet L-Functions
Abdelmejid Bayad