scientific article; zbMATH DE number 1284430
From MaRDI portal
Publication:4242024
Recommendations
Cited in
(99)- On automorphism groups of certain Goppa codes
- An intrinsical description of group codes
- Partial permutation decoding for the first-order Reed-Muller codes
- Graphs, designs and codes related to the n-cube
- Ternary codes from graphs on triples
- The automorphism groups of Reed-Solomon codes
- Permutation decoding for the binary codes from triangular graphs.
- PD-sets for the codes from incidence matrices of triangular graphs
- Extremal quasi-cyclic self-dual codes over finite fields
- \(LCD\) codes from adjacency matrices of graphs
- Binary codes and permutation decoding sets from the graph products of cycles
- Codes from adjacency matrices of uniform subset graphs
- Defining sets of extended cyclic codes invariant under the affine group
- Partial permutation decoding for codes from finite planes
- A self-orthogonal doubly even code invariant under \(M^c L:2\)
- Binary codes from graphs on triples
- Transitive permutation groups of prime-squared degree
- Codes from incidence matrices of graphs
- Special LCD codes from Peisert and generalized Peisert graphs
- Hamming graphs and special LCD codes
- Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
- 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\)
- Binary Hamming codes and Boolean designs
- Binary codes and partial permutation decoding sets from the odd graphs
- Ternary codes from some reflexive uniform subset graphs
- The group of permutation automorphisms of a q-ary Hamming code
- Automorphism groups of cyclic codes
- Codes from the incidence matrices of graphs on 3-sets
- Linear codes from ruled sets in finite projective spaces
- Binary codes from Paley graphs of prime-power-square order
- Binary codes from reflexive uniform subset graphs on 3-sets
- On the decomposition of self-dual codes over \(\mathbb F_2 + u\mathbb F_2\) with an automorphism of odd prime order
- 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
- Some designs and codes invariant under the simple group Co\(_{2}\)
- PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
- Information sets and partial permutation decoding for codes from finite geometries
- Self-dual extended cyclic codes
- On groups of odd prime-power degree that contain a full cycle
- Codes from the line graphs of complete multipartite graphs and PD-sets
- 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
- New advances in permutation decoding of first-order Reed-Muller codes
- Decomposing quasi-cyclic codes
- Codes from multipartite graphs and minimal permutation decoding sets
- A characterization of MDS codes that have an error correcting pair
- Codes over \(\mathcal{L}(\mathrm{GF}(2)^m, \mathrm{GF}(2)^m)\), MDS diffusion matrices and cryptographic applications
- Group Codes
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Codes and groups
- Construction of automorphism groups of Hamming codes A₇ and A₈
- The dimension of subcode-subfields of shortened generalized Reed-Solomon codes
- Research on the automorphism group of linear code
- Permutation decoding of codes from generalized Paley graphs
- scientific article; zbMATH DE number 3989252 (Why is no real title available?)
- Codes From Symmetry Groups, and a $[32, 17, 8]$ Code
- Codes associated with the odd graphs
- scientific article; zbMATH DE number 4121937 (Why is no real title available?)
- The automorphism groups of the generalized quadratic residue codes
- The automorphism groups of certain codes
- scientific article; zbMATH DE number 1426188 (Why is no real title available?)
- Binary codes and partial permutation decoding sets from the Johnson graphs
- Partial permutation decoding for MacDonald codes
- On binary linear codes whose automorphism group is trivial
- Designs and codes from involutions of An
- Linear codes resulting from finite group actions
- Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs (2k, k, k + 1, 1)
- PD-sets for codes related to flag-transitive symmetric designs
- Some designs and codes invariant under the Tits group
- Designs and codes from fixed points of finite groups
- On linear codes admitting large automorphism groups
- Generalized hypercube graph \(\mathcal{Q}_n(S)\), graph products and self-orthogonal codes
- The structure of sidelobe-preserving operator groups
- scientific article; zbMATH DE number 6783478 (Why is no real title available?)
- Automorphism groups of generalized Reed-Solomon codes
- Designs and codes from fixed points of elements of Janko simple group J₁
- Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
- On the classification and enumeration of self-dual codes
- Codes from lattice and related graphs, and permutation decoding
- Special \textit{LCD} codes from products of graphs
- On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group
- Using BL-algebras for codes
- Group code structures of affine-invariant codes
- Codes and designs from triangular graphs and their line graphs
- How to find small AI-systems for antiblocking decoding
- Isometry groups of formal languages for generalized Levenshtein distances
- The automorphism group of Generalized Reed-Muller codes
- The support designs of several families of lifted linear codes
- Designer of codes: a tribute to Jennifer Key
- Reed-Muller codes and permutation decoding
- Binary codes from rectangular lattice graphs and permutation decoding
- Self-dual codes from quotient matrices of symmetric divisible designs with the dual property
- Permutation decoding for binary codes from lattice graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Binary codes from the line graph of the \(n\)-cube
- Antiblocking decoding
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242024)
