scientific article; zbMATH DE number 1284430
From MaRDI portal
Publication:4242024
zbMath0926.94039MaRDI QIDQ4242024
Publication date: 24 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
group codescyclic codeReed-Solomon codesCauchy codesBCH codequadratic residue codesaffine-invariant codeautomorphism group of codes
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Other types of codes (94B60) Cyclic codes (94B15)
Related Items
PD-sets for the codes from incidence matrices of triangular graphs, A characterization of MDS codes that have an error correcting pair, On the decomposition of self-dual codes over \(\mathbb F_2 + u\mathbb F_2\) with an automorphism of odd prime order, Extremal quasi-cyclic self-dual codes over finite fields, \(LCD\) codes from adjacency matrices of graphs, Binary codes from rectangular lattice graphs and permutation decoding, Codes from the line graphs of complete multipartite graphs and PD-sets, The dimension of subcode-subfields of shortened generalized Reed-Solomon codes, Unnamed Item, Permutation decoding of codes from generalized Paley graphs, Codes from lattice and related graphs, and permutation decoding, Designs and codes from involutions of An, Unnamed Item, Codes over $\mathcal{L}(GF(2)^m,GF(2)^m)$, MDS Diffusion Matrices and Cryptographic Applications, Codes associated with the odd graphs, Binary codes and permutation decoding sets from the graph products of cycles, Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I, Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even, Special \textit{LCD} codes from products of graphs, Self-dual codes from quotient matrices of symmetric divisible designs with the dual property, On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group, Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1), Using BL-algebras for codes, Group code structures of affine-invariant codes, Codes from adjacency matrices of uniform subset graphs, Codes from incidence matrices of graphs, Information sets in abelian codes: defining sets and Groebner basis, Hulls of codes from incidence matrices of connected regular graphs, Codes associated with circulant graphs and permutation decoding, New advances in permutation decoding of first-order Reed-Muller codes, Permutation decoding for the binary codes from triangular graphs., Codes and designs from triangular graphs and their line graphs, Permutation decoding for binary codes from lattice graphs, How to find small AI-systems for antiblocking decoding, Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes, Designs and codes from fixed points of finite groups, Binary codes and partial permutation decoding sets from the Johnson graphs, Some designs and codes invariant under the simple group Co\(_{2}\), Partial permutation decoding for MacDonald codes, PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\), Some designs and codes invariant under the Tits group, On linear codes admitting large automorphism groups, Binary codes and partial permutation decoding sets from the odd graphs, Special LCD codes from Peisert and generalized Peisert graphs, Ternary codes from some reflexive uniform subset graphs, Linear codes resulting from finite group actions, Defining sets of extended cyclic codes invariant under the affine group, Hamming graphs and special LCD codes, Codes from incidence matrices and line graphs of Hamming graphs, Information sets and partial permutation decoding for codes from finite geometries, Binary codes from the line graph of the \(n\)-cube, Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\), The group of permutation automorphisms of a \(q\)-ary Hamming code, Automorphism groups of cyclic codes, Partial permutation decoding for codes from finite planes, Reed-Muller codes and permutation decoding, A self-orthogonal doubly even code invariant under \(M^c L:2\), On the classification and enumeration of self-dual codes, Codes from the incidence matrices of graphs on 3-sets, Antiblocking decoding, Self-dual extended cyclic codes, On the existence of PD-sets: algorithms arising from automorphism groups of codes, \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\), Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\), Codes from multipartite graphs and minimal permutation decoding sets, Binary Hamming codes and Boolean designs, PD-sets for codes related to flag-transitive symmetric designs, On automorphism groups of certain Goppa codes, An intrinsical description of group codes, Linear codes from ruled sets in finite projective spaces, Partial permutation decoding for the first-order Reed-Muller codes, Graphs, designs and codes related to the \(n\)-cube, Binary codes from graphs on triples, Ternary codes from graphs on triples, Binary codes from Paley graphs of prime-power-square order, On groups of odd prime-power degree that contain a full cycle, Designs and codes from fixed points of elements of Janko simple group J1, Binary codes from reflexive uniform subset graphs on 3-sets, Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs, Transitive permutation groups of prime-squared degree
