[图书][B] Projective geometries over finite fields
JWP Hirschfeld - 1998 - academic.oup.com
This book is an account of the combinatorics of projective spaces over a finite field, with
special emphasis on one and two dimensions. With its successor volumes, Finite projective …
special emphasis on one and two dimensions. With its successor volumes, Finite projective …
[图书][B] Reed-Solomon codes and their applications
SB Wicker, VK Bhargava - 1999 - books.google.com
Electrical Engineering/Communications/Information Theory" The Berlekamp article alone
will make this book worth having."--David Forney, Vice President, Motorola Codex Reed …
will make this book worth having."--David Forney, Vice President, Motorola Codex Reed …
[图书][B] Algebraic Geometric Codes: Basic Notions: Basic Notions
MA Tsfasman, SG Vlăduț, D Nogin - 2007 - books.google.com
The book is devoted to the theory of algebraic geometric codes, a subject formed on the
border of several domains of mathematics. on one side there are such classical areas as …
border of several domains of mathematics. on one side there are such classical areas as …
[PDF][PDF] Algebraic geometry codes
T Høholdt, JH Van Lint, R Pellikaan - Handbook of coding theory, 1998 - researchgate.net
Algebraic geometry codes Page 1 Algebraic geometry codes Tom Høholdt, Jacobus H. van Lint
and Ruud Pellikaan ∗ In the Handbook of Coding Theory, vol I, pp. 871-961, (VS Pless, WC …
and Ruud Pellikaan ∗ In the Handbook of Coding Theory, vol I, pp. 871-961, (VS Pless, WC …
The minimum distance of codes in an array coming from telescopic semigroups
C Kirfel, R Pellikaan - IEEE Transactions on information theory, 1995 - ieeexplore.ieee.org
The concept of an error-correcting array gives a new bound on the minimum distance of
linear codes and a decoding algorithm which decodes up to half this bound. This gives a …
linear codes and a decoding algorithm which decodes up to half this bound. This gives a …
Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes
Polar codes, introduced by Arıkan, achieve symmetric capacity of any discrete memoryless
channels under low encoding and decoding complexity. Recently, non-binary polar codes …
channels under low encoding and decoding complexity. Recently, non-binary polar codes …
On Goppa codes and Weierstrass gaps at several points
C Carvalho, F Torres - Designs, Codes and Cryptography, 2005 - Springer
On Goppa Codes and Weierstrass Gaps at Several Points⋆ Page 1 Designs, Codes and
Cryptography, 35, 211–225, 2005 © 2005 Springer Science+Business Media, Inc …
Cryptography, 35, 211–225, 2005 © 2005 Springer Science+Business Media, Inc …
Weierstrass pairs and minimum distance of Goppa codes
GL Matthews - Designs, Codes and Cryptography, 2001 - Springer
We prove that elements of the Weierstrassgap set of a pair of points may be used to define a
geometricGoppa code which has minimum distance greater than the usuallower bound. We …
geometricGoppa code which has minimum distance greater than the usuallower bound. We …
Decoding affine variety codes using Gröbner bases
J Fitzgerald, RF Lax - Designs, Codes and Cryptography, 1998 - Springer
We define a class of codes that we call affine variety codes. These codes are obtained by
evaluating functions in the coordinate ring of an affine variety on all the F q-rational points of …
evaluating functions in the coordinate ring of an affine variety on all the F q-rational points of …
The art of signaling: Fifty years of coding theory
AR Calderbank - IEEE transactions on information theory, 1998 - ieeexplore.ieee.org
In 1948 Shannon developed fundamental limits on the efficiency of communication over
noisy channels. The coding theorem asserts that there are block codes with code rates …
noisy channels. The coding theorem asserts that there are block codes with code rates …