# An Introduction to Algebraic and Combinatorial Coding Theory by Ian F. Blake

By Ian F. Blake

**Read Online or Download An Introduction to Algebraic and Combinatorial Coding Theory PDF**

**Best combinatorics books**

**Foundations of Combinatorial Topology **

Concise, rigorous creation to homology concept gains purposes to measurement idea and fixed-point theorems. Lucid assurance of the sphere contains examinations of complexes and their Betti teams, invariance of the Betti teams, and non-stop mappings and glued issues. Proofs are provided in an entire and cautious demeanour.

**Linear logic in computer science**

Linear good judgment is a department of facts conception which gives sophisticated instruments for the examine of the computational facets of proofs. those instruments contain a duality-based express semantics, an intrinsic graphical illustration of proofs, the advent of well-behaved non-commutative logical connectives, and the innovations of polarity and focalisation.

**Enumerative Combinatorics, Volume 2**

This moment quantity of a two-volume simple advent to enumerative combinatorics covers the composition of producing services, timber, algebraic producing features, D-finite producing capabilities, noncommutative producing features, and symmetric features. The bankruptcy on symmetric services offers the one on hand therapy of this topic compatible for an introductory graduate path on combinatorics, and contains the real Robinson-Schensted-Knuth set of rules.

**Extra resources for An Introduction to Algebraic and Combinatorial Coding Theory**

**Example text**

1 into sets st where each set is invariant under the mapping tf(n)(0 = iq mod n To each set s{;= {j\ jq, .. ,jqk~1}, integers mod «, there corresponds an irreducible polynomial with zeros η\ η]ρ, . . , η^~\ exponents mod n. The collection of these sets will be denoted by Σ ^ ) and the cardinality of this set aq{n). A set s, e Σ ^ ) will be called a q chain of n or a q chain mod n. ), then the polynomial is a polynomial over GF(q) and is a factor of xn — 1. Furthermore, any factor of x" — 1 is formed in this manner.

In this section we develop the results of MacWilliams and Pless relating the weight structure of a code to that of its dual. /2, then it may be easier to determine the weight structure of the dual code, which contains fewer vectors. We turn now to the formulas of MacWilliams and Pless. We define the weight enumerator of a code to be A(z)= ΣΑ,ζ' i=0 if the code contains Av codewords of weight /. Following the notation of MacWilliams (1962), we will denote the weight enumerator of a given code # by A(z) and that of its dual ^ 1 by B(z).

The dimension of the code, is n — mr = n — m deg g(z). Thus an (L, g) code has length \L\, dimension ^ [Λ - w deg #(z)], and distance d ^ 2 deg #(z) + 1 if #(z) has distinct roots. There will doubtless be much investigation of these codes. The minimum distance of a linear code is the weight of the minimum weight codeword, and this is a critical parameter in the evaluation of a code. However, in many practical instances it is important to know the number of codewords of each weight, and this determination is labeled the weight enumeration problem.