Algebraic-geometric codes and asymptotic problems

DOI10.1016/0166-218X(91)90120-LMaRDI QIDQ1180622zbMATH OpenOpenAlexFDO

Authors Mikhail Anatolievich Tsfasman

Publication date 27 June 1992

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(91)90120-l

zbMATH Keywords

linear codeupper and lower bounds\(q\)-ary codesasymptotic bounds of coding theorycodes from algebraic geometries

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Algebraic geometry codes with good asymptotic parameters
• scientific article; zbMATH DE number 774615
• scientific article; zbMATH DE number 4104859
• Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields

Cites work

• scientific article; zbMATH DE number 3836211 (Why is no real title available?)
• scientific article; zbMATH DE number 3855273 (Why is no real title available?)
• scientific article; zbMATH DE number 4156636 (Why is no real title available?)
• scientific article; zbMATH DE number 3818560 (Why is no real title available?)
• scientific article; zbMATH DE number 4037764 (Why is no real title available?)
• scientific article; zbMATH DE number 4047601 (Why is no real title available?)
• scientific article; zbMATH DE number 4104859 (Why is no real title available?)
• scientific article; zbMATH DE number 3771502 (Why is no real title available?)
• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• scientific article; zbMATH DE number 3803619 (Why is no real title available?)
• A note on lower bounds (Corresp.)
• An exhaustion bound for algebraic-geometric ``modular codes
• An improvement of the Gilbert bound for constant weight codes (Corresp.)
• Goppa codes that are better than the Varshamov-Gilbert bound
• Linear codes and modular curves
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
• Number of points of an algebraic curve
• On the decoding of algebraic-geometric codes
• Selbstduale Goppa-Codes

Cited in

(24)

• Constructions and bounds on linear error-block codes
• Intersecting codes and separating codes
• On improved asymptotic bounds for codes from global function fields
• Asymptotic bounds on quantum codes from algebraic geometry codes
• The asymptotic theory of algebraic-geometry codes
• Intersecting codes and partially identifying codes
• Good codes based on very sparse matrices
• scientific article; zbMATH DE number 4104859 (Why is no real title available?)
• Asymptotic properties of zeta-functions
• Curves of large genus covered by the hermitian curve
• Bounds for codes over the unit circle
• scientific article; zbMATH DE number 774615 (Why is no real title available?)
• An exhaustion bound for algebraic-geometric ``modular codes
• On group structures realized by elliptic curves over a fixed finite field
• Some Maximal Function Fields and Additive Polynomials
• Frameproof codes against limited coalitions of pirates
• scientific article; zbMATH DE number 4164733 (Why is no real title available?)
• A note on optimal towers over finite fields
• On codes over \(\mathrm{FFN}(1,q)\)-projective varieties
• scientific article; zbMATH DE number 4037764 (Why is no real title available?)
• Yet another variation on minimal linear codes
• Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
• A method of constructing linear mapping families to achieve the asymptotic GV bound
• A computability challenge: asymptotic bounds for error-correcting codes

This page was built for publication: Algebraic-geometric codes and asymptotic problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180622)