PD-sets for the codes related to some classical varieties
A permutation decoding set (PD set) is a subset of the automorphism group of the code such that every possible error vectors of weight less than or equal to the number of errors the code can correct can be sent by an element of this subset out of the information positions. These sets are useful in decoding received vectors. The authors generalize this definition to an arbitrary permutation set. They show how the automorphisms fixing a subset of the points in a projective space induce automorphisms of the code formed from this space. They produce PD-sets for Benz planes of small order and for ruled rational normal surfaces of order 3 in \(\text{PG}(4,3)\) and \(\text{PG}(4,4).\)
- \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\)
- PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
- Antiblocking systems and PD-sets
- Partial permutation decoding for codes from finite planes
- Codewords for projective planes from sets of type (s,t)
- Einbettung gewisser Kettengeometrien in projektive Räume
- scientific article; zbMATH DE number 3710910 (Why is no real title available?)
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- scientific article; zbMATH DE number 53569 (Why is no real title available?)
- scientific article; zbMATH DE number 3586097 (Why is no real title available?)
- scientific article; zbMATH DE number 1284415 (Why is no real title available?)
- scientific article; zbMATH DE number 775280 (Why is no real title available?)
- scientific article; zbMATH DE number 3393284 (Why is no real title available?)
- scientific article; zbMATH DE number 3408440 (Why is no real title available?)
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Graphs, designs and codes related to the n-cube
- PD-sets for the codes from incidence matrices of triangular graphs
- Binary codes and permutation decoding sets from the graph products of cycles
- Codes from incidence matrices of graphs
- 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 codes and partial permutation decoding sets from the odd graphs
- 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
- Information sets in abelian codes: defining sets and Groebner basis
- Hulls of codes from incidence matrices of connected regular graphs
- Antiblocking systems and PD-sets
- PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
- Partial permutation decoding for binary linear Hadamard codes
- Codes associated with the odd graphs
- scientific article; zbMATH DE number 820485 (Why is no real title available?)
- Binary codes and partial permutation decoding sets from the Johnson graphs
- Partial permutation decoding for MacDonald codes
- Improved partial permutation decoding for Reed-Muller codes
- 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
- On linear codes admitting large automorphism groups
- Codes from lattice and related graphs, and permutation decoding
- Special \textit{LCD} codes from products of graphs
- How to find small AI-systems for antiblocking decoding
- Reed-Muller codes and permutation decoding
- 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: PD-sets for the codes related to some classical varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569931)
