Algebraic Codes on Lines, Planes, and Curves by Richard E. Blahut

By Richard E. Blahut

Algebraic geometry is frequently hired to encode and decode indications transmitted in verbal exchange platforms. This booklet describes the basic rules of algebraic coding thought from the viewpoint of an engineer, discussing a couple of purposes in communications and sign processing. The primary proposal is that of utilizing algebraic curves over finite fields to build error-correcting codes. the latest advancements are awarded together with the idea of codes on curves, with no using designated arithmetic, substituting the serious conception of algebraic geometry with Fourier remodel the place attainable. the writer describes the codes and corresponding interpreting algorithms in a way that permits the reader to judge those codes opposed to functional purposes, or to aid with the layout of encoders and decoders. This booklet is suitable to practising communique engineers and people focused on the layout of latest conversation platforms, in addition to graduate scholars and researchers in electric engineering.

Show description

Read or Download Algebraic Codes on Lines, Planes, and Curves PDF

Similar signal processing books

Survivability and Traffic Grooming in WDM Optical Networks

The appearance of fiber optic transmission structures and wavelength department multiplexing has resulted in a dramatic raise within the usable bandwidth of unmarried fiber structures. This ebook offers specified assurance of survivability (dealing with the chance of wasting huge volumes of site visitors info as a result of a failure of a node or a unmarried fiber span) and site visitors grooming (managing the elevated complexity of smaller person requests over excessive potential information pipes), either one of that are key matters in sleek optical networks.

Principles of Semiconductor Network Testing (Test & Measurement)

This booklet gathers jointly entire info which try out and strategy pros will locate important. The suggestions defined can help make sure that attempt tools and knowledge accumulated replicate real gadget functionality, instead of 'testing the tester' or being misplaced within the noise ground. This ebook addresses the elemental matters underlying the semiconductor attempt self-discipline.

Opportunistic Spectrum Sharing and White Space Access: The Practical Reality

Information the paradigms of opportunistic spectrum sharing and white area entry as potent skill to meet expanding call for for high-speed instant conversation and for novel instant verbal exchange purposes This e-book addresses opportunistic spectrum sharing and white house entry, being really aware of functional concerns and options.

From photon to pixel : the digital camera handbook

The camera conceals notable technological recommendations that have an effect on the formation of the picture, the colour illustration or computerized measurements and settings. ** From photon to pixel photon ** describes the machine either from the viewpoint of the physics of the phenomena concerned, as technical parts and software program it makes use of.

Extra info for Algebraic Codes on Lines, Planes, and Curves

Sample text

Vr−1 , but ( (x), L) does not produce the sequence V = (V0 , V1 , . . , Vr−1 , Vr ), then L(V ) ≥ r + 1 − L. Proof: Suppose that the recursion ( ′ (x), L′ ) is any linear recursion that produces the longer sequence V . Then ( (x), L) and ( ′ (x), L′ ) both produce the sequence V0 , V1 , . . , Vr−1 . If L′ ≤ r − L, then r ≥ L′ + L. By the agreement theorem, both must produce the same value at iteration r, contrary to the assumption of the theorem. Therefore L′ > r − L. If it is further specified that ( (x), L) is the minimum-length linear recursion that produces the sequence V0 , V1 , .

S, is the all-zero vector. Proof: This bound is a special case of the Roos bound, which is given next. Notice that the Hartmann–Tzeng bound is based on s+1 uniformly spaced substrings of zeros in the spectrum, each substring of length d −1−s. The Roos bound, given next, allows the evenly spaced repetition of these s + 1 substrings of zeros to be interrupted by some nonzero substrings, as long as there are not too many such nonzero substrings. The Roos bound can be further extended by combining it with the cyclic decimation property.

The degree of the nonzero polynomial v (x) is the largest degree of any monomial appearing as a term of v (x) with a nonzero coefficient. The degree of the zero polynomial is −∞. 4 Univariate and homogeneous bivariate polynomials polynomial is the number of its nonzero coefficients. A polynomial v (x) may also be called a univariate polynomial v (x) when one wishes to emphasize that there is only a single polynomial indeterminate x. Two polynomials v (x) and v ′ (x) over the same field can be added by the rule v (x) + v ′ (x) = (vi + vi′ )xi , i and can be multiplied by the rule v (x)v ′ (x) = ′ vj vi−j xi .

Download PDF sample

Rated 4.06 of 5 – based on 6 votes