Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
algorithmclassificationerror-correcting linear codegenerator matrixisometrylatticeorderly generationpermutation group
Combinatorial aspects of finite geometries (05B25) Linear Diophantine equations (11D04) Projective and enumerative algebraic geometry (14Nxx) Combinatorial structures in finite projective spaces (51E20) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Theory of error-correcting codes and error-detecting codes (94Bxx)
The theory of error-correcting codes is a rather new addition to the list of mathematical disciplines. Currently, this theory is no more than 60 years old. It grew out of the need to communicate information electronically. Being an applied discipline by definition, a large number of mathematical areas are connected into Coding Theory -- Linear Algebra, Algebra and Combinatorics, Number Theory and Geometry, etc. This book contains 51 figures and 102 tables. It starts from the channel model of communication in the presence of noise. From there, the authors develop the fundamental concepts, like the Hamming metric and the maximum likelihood decoding principle. This book takes unusual turn after discussing dual codes and simple decoding procedures. After raising the question of what it means for codes to be essentially different, the metric Hamming space is considered together with its isometries (the maps which preserving the metric structure). The authors call the codes isometric if they are equivalent as subspaces of the Hamming space. After that, the discussion shifts to a more abstract analysis of the different kinds of isometries. In essence, the book serves two purposes. On the one hand, the book introduces the fundamentals of the theory of error-correcting codes like parameters, bounds as well as known classes of codes (Chapter 1--4). Also included is an introduction to the theory of finite fields (Chapter 3). Moreover, the application of Coding Theory to CD-players is discussed in details (Chapter 5). On the other hand, the second part (Chapter 6--9) of the book covers more advanced and specialized topics like the classification of linear codes by isometry, the enumeration of isometry classes, random generation of codes, the use of lattice basis reduction to compute minimum distances, etc. Chapter A (the appendix) contains an introduction to the attached compact disc. It describes the instalation of the software in both a Windows and a Linux environment. It also gives a survey on the accompanying data. The included software allows one to compute the minimum distance and the weight distribution of given codes, construct codes with a given minimum distance and randomly generate linear codes which are uniformly distributed over the isometry classes with given parameters. The dynamic tables describe the isometry classes of linear codes. Moreover, there are tables containing information on optimal linear codes. In addition, corresponding generator matrices can be found. Altogether, in about two million isometry classes have been computed of which more than 800 000 are optimal codes. Nearly 200 000 generator matrices can be found on the attached compact disc, of which more than 70 000 generate optimal codes. The book provides access to all results at a level which is proper for graduate students of mathematics and computer science as well as for researchers.
- Twisted tensor product codes
- Binary self-dual codes with automorphisms of order 23
- Construction of binary and ternary self-orthogonal linear codes
- Error correcting codes via reversible cellular automata over finite fields
- Binary Parseval frames from group orbits
- What is odd about binary Parseval frames?
- Normal forms for matrices over uniserial rings of length two
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- On the classification of unitals on 28 points of low rank
- The equivalence of linear codes implies semi-linear equivalence
- Some new results on dimension and Bose distance for various classes of BCH codes
- Cyclic distances of idempotent convolutional codes
- Maximal arcs, codes, and new links between projective planes of order 16
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- Classification and nonexistence results for linear codes with prescribed minimum distances
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
- New quantum codes from CSS codes
- Symplectic 4-dimensional semifields of order \(8^4\) and \(9^4\)
- scientific article; zbMATH DE number 1584397 (Why is no real title available?)
- Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory
- Recent progress on weight distributions of cyclic codes over finite fields
- Further results on the classification of MDS codes
- Update on the Extension of Good Linear Codes
- An extension of the Brouwer-Zimmermann minimum weight algorithm
- On finite permutation groups with a transitive cyclic subgroup.
- Linear codes from vectorial Boolean functions in the context of algebraic attacks
- Computing an invariant of a linear code
- Identities for Dirichlet and Lambert-type series arising from the numbers of a certain special word
- The program \textsc{Generation} in the software package \textsc{QextNewEdition}
- Cryptanalysis of the BBCRS system on Reed-Muller binary code
- Non-singular cubic surfaces over \(\mathbb{F}_{2^k}\)
- Optimal arrangements of classical and quantum states with limited purity
- Binary linear codes with near-extremal maximum distance
- Type IV codes over a non-local non-unital ring
- Quasi self-dual codes over non-unital rings of order six
- BCH codes with minimum distance proportional to code length
- Complex Hantzsche-Wendt manifolds
- Enumeration of the semilinear isometry classes of linear codes
- Multiplicative Invariant Fields of Dimension ≤6
- A class of minimal cyclic codes over finite fields
- Theory of additive complementary dual codes, constructions and computations
- Construction methods for Galois LCD codes over finite fields
- Extremal ternary self-dual codes of length 36 and symmetric 2-(36, 15, 6) designs with an automorphism of order 2
- On additive MDS codes over small fields
- On extremal and near-extremal self-dual ternary codes
- On the \(\sigma\) duals and \(\sigma\) hulls of linear codes
- Two classes of LCD BCH codes over finite fields
- Symmetric \(2-(36,15,6)\) designs with an automorphism of order two
- Computer classification of linear codes based on lattice point enumeration
- Large sets of Desargues configurations
- \(\sigma\) hulls of Goppa codes and related codes over \(\mathbb{F}_q\)
- On general self-orthogonal matrix-product codes associated with Toeplitz matrices
- On p-group isomorphism: search-to-decision, counting-to-decision and nilpotency class reductions via tensors
- On Schubert cells of Lie geometries and public keys of multivariate cryptography
- Constructing two-weight codes with prescribed groups of automorphisms
- \((l,s)\)-extension of linear codes
This page was built for publication: Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500513)
