Pages that link to "Item:Q3937290"
From MaRDI portal
The following pages link to Minimal permutation sets for decoding the binary Golay codes (Corresp.) (Q3937290):
Displayed 42 items.
- Partial permutation decoding for binary linear Hadamard codes (Q283663) (← links)
- Permutation decoding of codes from generalized Paley graphs (Q371247) (← links)
- Codes associated with the odd graphs (Q393176) (← 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)
- Codes and designs from triangular graphs and their line graphs (Q651292) (← links)
- How to find small AI-systems for antiblocking decoding (Q658118) (← links)
- Reed-Muller codes and permutation decoding (Q712223) (← links)
- Binary codes from rectangular lattice graphs and permutation decoding (Q854813) (← links)
- Permutation decoding for binary codes from lattice graphs (Q924975) (← 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)
- Partial permutation decoding for the first-order Reed-Muller codes (Q1025449) (← links)
- Graphs, designs and codes related to the \(n\)-cube (Q1025949) (← links)
- Permutation decoding for the binary codes from triangular graphs. (Q1422399) (← links)
- PD-sets for the codes from incidence matrices of triangular graphs (Q1617766) (← links)
- Partial permutation decoding for codes from finite planes (Q1775031) (← 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)
- Codes from the incidence matrices of graphs on 3-sets (Q2275405) (← 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)
- Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes (Q2413011) (← 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)
- Information sets and partial permutation decoding for codes from finite geometries (Q2490139) (← links)
- PD-sets for the codes related to some classical varieties (Q2569931) (← links)
- Codes from the line graphs of complete multipartite graphs and PD-sets (Q2643315) (← links)
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even (Q2682394) (← links)
- New advances in permutation decoding of first-order Reed-Muller codes (Q2701051) (← links)
- Codes from multipartite graphs and minimal permutation decoding sets (Q2788739) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← 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)
- PD-sets for codes related to flag-transitive symmetric designs (Q5135456) (← links)
- Special \textit{LCD} codes from products of graphs (Q6115436) (← links)
