Error-correcting linear codes. Classification by isometry and applications. With CD-ROM

zbMath1102.94001MaRDI QIDQ2500513

Anton Betten, Axel Kohnert, Adalbert Kerber, Harald Fripertinger, Michael Braun, Alfred Wassermann

Publication date: 17 August 2006

Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)

zbMATH Keywords

latticeclassificationalgorithmisometrypermutation groupgenerator matrixorderly generationerror-correcting linear code

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Combinatorial structures in finite projective spaces (51E20) Linear Diophantine equations (11D04) Theory of error-correcting codes and error-detecting codes (94Bxx) Projective and enumerative algebraic geometry (14Nxx)

Related Items (44)

The Program Generation in the Software Package QextNewEdition ⋮ Recent progress on weight distributions of cyclic codes over finite fields ⋮ Error correcting codes via reversible cellular automata over finite fields ⋮ An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm ⋮ Further results on the classification of MDS codes ⋮ Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes ⋮ The equivalence of linear codes implies semi-linear equivalence ⋮ Binary Parseval frames from group orbits ⋮ Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory ⋮ Nonsingular cubic surfaces over F2k ⋮ What is odd about binary Parseval frames? ⋮ Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I ⋮ Theory of additive complementary dual codes, constructions and computations ⋮ Construction methods for Galois LCD codes over finite fields ⋮ Some new results on dimension and Bose distance for various classes of BCH codes ⋮ Extremal ternary self-dual codes of length 36 and symmetric 2-(36, 15, 6) designs with an automorphism of order 2 ⋮ Optimal arrangements of classical and quantum states with limited purity ⋮ On finite permutation groups with a transitive cyclic subgroup. ⋮ On additive MDS codes over small fields ⋮ New quantum codes from CSS codes ⋮ Cyclic distances of idempotent convolutional codes ⋮ Classification and nonexistence results for linear codes with prescribed minimum distances ⋮ Symplectic 4-dimensional semifields of order \(8^4\) and \(9^4\) ⋮ 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 ⋮ A class of minimal cyclic codes over finite fields ⋮ Complex Hantzsche-Wendt manifolds ⋮ Normal forms for matrices over uniserial rings of length two ⋮ Constructing two-weight codes with prescribed groups of automorphisms ⋮ \((l,s)\)-extension of linear codes ⋮ Twisted tensor product codes ⋮ Binary self-dual codes with automorphisms of order 23 ⋮ Maximal arcs, codes, and new links between projective planes of order 16 ⋮ Construction of binary and ternary self-orthogonal linear codes ⋮ Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes ⋮ Linear codes from vectorial Boolean functions in the context of algebraic attacks ⋮ On the classification of unitals on 28 points of low rank ⋮ Computing an Invariant of a Linear Code ⋮ Update on the Extension of Good Linear Codes ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation ⋮ Identities for Dirichlet and Lambert-type series arising from the numbers of a certain special word ⋮ Multiplicative Invariant Fields of Dimension ≤6

This page was built for publication: Error-correcting linear codes. Classification by isometry and applications. With CD-ROM