Download e-book for kindle: Algebraic-Geometric Codes by M. Tsfasman, S.G. Vladut
By M. Tsfasman, S.G. Vladut
1. Codes.- 1.1. Codes and their parameters.- 1.2. Examples and constructions.- 1.3. Asymptotic problems.- 2. Curves.- 2.1. Algebraic curves.- 2.2. Riemann-Roch theorem.- 2.3. Rational points.- 2.4. Elliptic curves.- 2.5. Singular curves.- 2.6. rate reductions and schemes.- three. AG-Codes.- 3.1. buildings and properties.- 3.2. Examples.- 3.3. Decoding.- 3.4. Asymptotic results.- four. Modular Codes.- 4.1. Codes on classical modular curves.- 4.2. Codes on Drinfeld curves.- 4.3. Polynomiality.- five. Sphere Packings.- 5.1. Definitions and examples.- 5.2. Asymptotically dense packings.- 5.3. quantity fields.- 5.4. Analogues of AG-codes.- Appendix. precis of effects and tables.- A.1. Codes of finite length.- A.1.1. Bounds.- A.1.2. Parameters of yes codes.- A.1.3. Parameters of definite constructions.- A.1.4. Binary codes from AG-codes.- A.2. Asymptotic bounds.- A.2.1. checklist of bounds.- A.2.2. Diagrams of comparison.- A.2.3. Behaviour on the ends.- A.2.4. Numerical values.- A.3. extra bounds.- A.3.1. consistent weight codes.- A.3.2. Self-dual codes.- A.4. Sphere packings.- A.4.1. Small dimensions.- A.4.2. convinced families.- A.4.3. Asymptotic results.- writer index.- checklist of symbols.
Read or Download Algebraic-Geometric Codes PDF
Best algebraic geometry books
This can be a good written vintage textual content at the connection among algebra and geometry. a number of the issues coated comprise a reconstruction of affine geometry of a box (or department ring) from geometric axioms. A geometry is a triple of a collection of issues, a collection of traces, and a binary relation describing whilst some degree lies on a line and gratifying the next 3 axioms: (1) any targeted issues are attached via a different line, (2) given some extent P and a line l, there exists a distinct line m parallel to l via P, and (3) there exist 3 issues that aren't collinear.
Because the time of Lagrange and Euler, it's been popular that an knowing of algebraic curves can light up the image of inflexible our bodies supplied by means of classical mechanics. Many mathematicians have validated a contemporary view of the position performed through algebraic geometry lately. This booklet offers a few of these sleek ideas, which fall in the orbit of finite dimensional integrable platforms.
The type of algebraic surfaces is an complex and engaging department of arithmetic, built over greater than a century and nonetheless an lively sector of analysis this day. during this ebook, Professor Beauville supplies a lucid and concise account of the topic, expressed easily within the language of recent topology and sheaf thought, and available to any budding geometer.
This quantity comprises papers in response to shows given on the Pan-American complicated reports Institute (PASI) on commutative algebra and its connections to geometry, which was once held August 3-14, 2009, on the Universidade Federal de Pernambuco in Olinda, Brazil. the most target of this system was once to element fresh advancements in commutative algebra and interactions with such parts as algebraic geometry, combinatorics and desktop algebra.
- Positivity in Algebraic Geometry II: Positivity for Vector Bundles, and Multiplier Ideals
- Abelian Varieties, Theta Functions and the Fourier Transform
- Algebraic Geometry: Proceedings of the US-USSR Symposium held in Chicago, June 20–July 14, 1989
- An Introduction to the Langlands Program
- Local Algebra - Multiplicities
Extra resources for Algebraic-Geometric Codes
1 11 C c IF~ degenerate iff the subspace of vectors We call a linear code C s;; IF qn - 1 c IF q , where IF qn - 1 is having 0 in some fixed position. k ~ 1 and d ~ 1. 6. one-to-one correspondence between the set of equi val ence classes of non-degenerate linear [n,k,d]q-codes and the set of equivalence classes of projective [n,k,d] -systems. 7. • Prove the theorem. projective systems have an advantage of dispensing with a choice of some particular code in its equivalence class; they also look more natural than codes since there is no choice of basis involved.
In many cases it is difficult to calculate precise values of parameters but it is possible to bound them. The spoiling lemma makes it possible to pass from an [:s n, d]q-code C to an [n,k,d]q-code. In such a situation we say that up to a spoiling the code C is an [n,k,d]q-code. 2: k, 2: So we can always spoil parameters, but of course we cannot always make them better. Here are some restrictions. 36 (the Singleton bound). linear [n,k,d]q-code For any Part 1 CODES 28 Proof: Let us argue in terms of [n,k,d]q-systems.
Particular that the parameters do coincide. Projective systems. object. e. the space ~(V) linear space over V) IFq . [n,k,d]q-system is a finite unordered family of ~ which (note that we write does I 'P I ~ n = I'PI, dim 'P c multiplicities). follows: not ~ ~ lie in = dim ~ + 1, 'P (projective) + 1 = dim V ). 1 11 C c IF~ degenerate iff the subspace of vectors We call a linear code C s;; IF qn - 1 c IF q , where IF qn - 1 is having 0 in some fixed position. k ~ 1 and d ~ 1. 6. one-to-one correspondence between the set of equi val ence classes of non-degenerate linear [n,k,d]q-codes and the set of equivalence classes of projective [n,k,d] -systems.