Pages that link to "Item:Q2569931"

The following pages link to PD-sets for the codes related to some classical varieties (Q2569931):

Displaying 32 items.

• Partial permutation decoding for binary linear Hadamard codes (Q283663) (← links)
• Codes associated with the odd graphs (Q393176) (← links)
• Binary codes and partial permutation decoding sets from the Johnson graphs (Q497331) (← links)
• Partial permutation decoding for MacDonald codes (Q503553) (← links)
• Improved partial permutation decoding for Reed-Muller codes (Q507498) (← links)
• On linear codes admitting large automorphism groups (Q517270) (← links)
• Codes from lattice and related graphs, and permutation decoding (Q602759) (← links)
• How to find small AI-systems for antiblocking decoding (Q658118) (← links)
• Reed-Muller codes and permutation decoding (Q712223) (← links)
• Codes from incidence matrices and line graphs of Hamming graphs (Q973112) (← links)
• Binary codes from the line graph of the \(n\)-cube (Q975825) (← links)
• Antiblocking decoding (Q987699) (← links)
• Graphs, designs and codes related to the \(n\)-cube (Q1025949) (← links)
• Binary codes and permutation decoding sets from the graph products of cycles (Q1683975) (← links)
• Codes from incidence matrices of graphs (Q1951220) (← links)
• Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\) (Q2014219) (← links)
• On the existence of PD-sets: algorithms arising from automorphism groups of codes (Q2025365) (← links)
• \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\) (Q2025378) (← links)
• Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\) (Q2025383) (← links)
• Binary codes and partial permutation decoding sets from the odd graphs (Q2248512) (← links)
• Codes from the incidence matrices of graphs on 3-sets (Q2275405) (← links)
• Linear codes from ruled sets in finite projective spaces (Q2306908) (← links)
• Binary codes from Paley graphs of prime-power-square order (Q2329171) (← links)
• Binary codes from reflexive uniform subset graphs on 3-sets (Q2346712) (← links)
• Information sets in abelian codes: defining sets and Groebner basis (Q2436565) (← links)
• Hulls of codes from incidence matrices of connected regular graphs (Q2436579) (← links)
• Antiblocking systems and PD-sets (Q2468024) (← links)
• PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\) (Q2468025) (← links)
• Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even (Q2682394) (← links)
• Linear codes resulting from finite group actions (Q5104012) (← links)
• Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2<i>k, k, k</i> + 1<i>,</i> 1) (Q5113374) (← links)
• Special \textit{LCD} codes from products of graphs (Q6115436) (← links)