Error-correcting codes on low rank surfaces
نویسنده
چکیده
In this paper we construct some algebraic geometric error-correcting codes on surfaces whose Neron-Severi group has low rank. If the rank of the Neron-Severi group is 1, the intersection of this surface with an irreducible surface of lower degree will be an irreducible curve, and this makes possible the construction of codes with good parameters. Rank 1 surfaces are not easy to find, but we are able to find surfaces with low rank, and those will give us good codes too.
منابع مشابه
Rank error-correcting pairs
Error-correcting pairs were introduced independently by Pellikaan and Kötter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known families of codes. In this paper, we define new types of vector products, extending the coordinatewise product, some of which preserve symbolic products of linearize...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملAsymmetric Quantum Codes on Toric Surfaces
Asymmetric quantum error-correcting codes are quantum codes defined over biased quantum channels: qubitflip and phase-shift errors may have equal or different probabilities. The code construction is the Calderbank-ShorSteane construction based on two linear codes. We present families of toric surfaces, toric codes and associated asymmetric quantum error-correcting codes.
متن کاملProperties of codes in rank metric
We study properties of rank metric and codes in rank metric over finite fields. We show that perfect codes do not exist. We derive an equivalent of the Varshamov-Gilbert bound in Hamming metric. We study the asymptotic behavior of the minimum rank distance of codes that are on GV. We show that the packing density of maximum rank distance codes is lower bounded by a function depending on the err...
متن کاملError Correcting Codes on Algebraic Surfaces
Lomont, Chris C.. Ph.D., Purdue University, May, 2003. Error Correcting Codes on Algebraic Surfaces. Major Professor: Tzuong-Tsieng Moh. Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from blowing up points in P are briefly studied, then codes resulting fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 13 شماره
صفحات -
تاریخ انتشار 2007