Introduction to coding theory.
algebraic geometry codesarithmetic codesBCH codesblock codesboundsconvolutional codescyclic codesGoppa codesKrawtchouk polynomialsLee metriclinear programming boundperfect codesquadratic Kerdock codesReed-Muller codesReed-Solomon codesShannon theoremuniformly packed codesVan Lint-Wilson bound
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Sampling theory in information and communication theory (94A20) Linear codes (general theory) (94B05) Convolutional codes (94B10) Cyclic codes (94B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Arithmetic codes (94B40) Theory of error-correcting codes and error-detecting codes (94Bxx)
Over the past decades many books on coding theory have been issued but Introduction to Coding Theory by J. H. van Lint remains to be one of the most favorite textbooks for many lecturers giving courses on coding theory. So the appearance of the 3rd edition is a very welcome event. Here we point out only the revisions and expansions and refer to ``Coding theory, Lect. Notes Math. 201 (1971; Zbl 0224.94002), and previous eds. (1st ed. 1982; Zbl 0485.94015 and 2nd ed. 1992; Zbl 0747.94018) for more information. The main additions are: (1) Two new chapters: ``Codes over \(\mathbb Z_4\) and ``Algebraic geometry codes, are added. The corresponding research areas are currently enjoying strong interest and fast development. Both chapters are supplied with plenty of examples and exercises. Each of them is a brief, but lucid introduction to the subject providing the reader with the necessary knowledge for further studying. (2) Chapter 6 ``Cyclic codes is expanded by including Generalized Reed-Solomon codes and Generalized Reed-Muller codes. Also, a paragraph (``Coding gains) concerning more practical aspects of using error-correcting codes is added in Chapter 2. The section ``The Lee metric is another addition.
- Linear programming bounds for codes via a covering argument
- Imprimitive distance-transitive graphs with primitive core of diameter at least 3
- On the maximality of linear codes
- Testing algebraic geometric codes
- On codes from hypergraphs.
- A projective two-weight code related to the simple group \(\mathrm{Co}_1\) of Conway
- Induced weights on quotient modules and an application to error correction in coherent networks
- Duality of codes supported on regular lattices, with an application to enumerative combinatorics
- Local expanders
- Linked systems of symmetric designs
- The minimal \(k\)-dispersion of point sets in high dimensions
- Nonlinear diffusion layers
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Hadamard matrices and doubly even self-dual error-correcting codes
- Generalized minimum aberration for asymmetrical fractional factorial designs
- Generalized minimum aberration for asymmetrical fractional factorial designs.
- Character sums and MacWilliams identities
- Slight improvements of the Singleton bound
- Algebraic geometric codes with applications
- Traceability codes
- On coset leader graphs of structured linear codes
- On a conjecture regarding identification in Hamming graphs
- Infinite families of 2-designs and 3-designs from linear codes
- On polynomials x^n-1 over binary fields whose irreducible factors are binomials and trinomials
- Combinatorial \(t\)-designs from special functions
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Non-uniform packings
- PAC-learning gains of Turing machines over circuits and neural networks
- Computing normalisers of intransitive groups
- Subgroup regular sets in Cayley graphs
- Solving a fixed number of equations over finite groups
- On the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier support
- Binary codes from Paley graphs of prime-power-square order
- Some (almost) optimally extendable linear codes
- Fourier-reflexive partitions and MacWilliams identities for additive codes
- Heuristic decoding of linear codes using commutative algebra
- The spectra of subKautz and cyclic Kautz digraphs
- On Bonisoli's theorem and the block codes of Steiner triple systems
- Infinite families of 3-designs from a type of five-weight code
- New short coverings of \(\mathbb{F}_q^3\) from pairwise weakly linearly independent sets
- Vectorial resilient \(\mathrm{PC}(l)\) of order \(k\) Boolean functions from AG-codes
- On doubly-cyclic convolutional codes
- Isometric embeddings of finite fields
- Linear codes using skew polynomials with automorphisms and derivations
- Affine Cartesian codes
- Integer invariants of abelian Cayley graphs
- On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics
- Minimum aberration blocking schemes for two- and three-level fractional factorial designs
- On the weight distribution of convolutional codes
- Monotone maps, sphericity and bounded second eigenvalue
- The enumerability of P collapses P to NC
- Erdős-Burgess constant in commutative rings
- A class of binary cyclic codes with optimal parameters
- A new class of distance-optimal binary cyclic codes and their duals
- New quantum codes from constacyclic codes over a non-chain ring
- Grassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes
- A characterization of MDS codes that have an error correcting pair
- On mean values of the \(L_q\)-discrepancies of point distributions
- Lattices and codes. A course partially based on lectures by Friedrich Hirzebruch
- The union-closed sets conjecture almost holds for almost all random bipartite graphs
- scientific article; zbMATH DE number 3847301 (Why is no real title available?)
- Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\)
- Expander graphs and their applications
- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
- Hierarchical Models, Marginal Polytopes, and Linear Codes
- Doubly-Periodic Sequences and Two-Dimensional Recurrences
- Hadamard tensors and lower bounds on multiparty communication complexity
- scientific article; zbMATH DE number 51371 (Why is no real title available?)
- scientific article; zbMATH DE number 53945 (Why is no real title available?)
- scientific article; zbMATH DE number 1209696 (Why is no real title available?)
- On the structure of linear recurrent error-control codes
- scientific article; zbMATH DE number 2041021 (Why is no real title available?)
- A stronger bound for the strong chromatic index
- On zeros of a polynomial in a finite grid
- Descriptional complexity of error detection
- Extending Swerdlow's hypothesis: statistical models of mitochondrial deterioration and aging
- Graphs, friends and acquaintances
- Alternative metrics
- Binary code properties of perfect matching in hexagonal graph
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- The diameter of cyclic Kautz digraphs
- 1-generator generalized quasi-cyclic codes over \(\mathbb {Z}_{4}\)
- Typically-correct derandomization for small time and space
- Erdős-Falconer distance problem under Hamming metric in vector spaces over finite fields
- Weighted counting of solutions to sparse systems of equations
- Weight enumerators of Reed-Muller codes from cubic curves and their duals
- Saturated subgraphs of the hypercube
- Packing the hypercube
- Minimality and other properties of the width-𝑤 nonadjacent form
- Parameters of 2-designs from some BCH codes
- Decoding algorithm as a moment problem related to the extended Lotka–Volterra system
- Reed-Muller Codes
- Decoding turbo-like codes via linear programming
- Colorings of the \(d\)-regular infinite tree
- scientific article; zbMATH DE number 7687823 (Why is no real title available?)
- One more proof of the first linear programming bound for binary codes and two conjectures
- Linear ternary codes of strongly regular signed graphs
- An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem
- New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes
- Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
This page was built for publication: Introduction to coding theory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230829)
