Pages that link to "Item:Q1422399"

The following pages link to Permutation decoding for the binary codes from triangular graphs. (Q1422399):

Displaying 35 items.

• Binary codes and partial permutation decoding sets from the Johnson graphs (Q497331) (← links)
• On linear codes admitting large automorphism groups (Q517270) (← links)
• Codes from lattice and related graphs, and permutation decoding (Q602759) (← links)
• On the constructions of holomorphic vertex operator algebras of central charge 24 (Q634622) (← links)
• Codes and designs from triangular graphs and their line graphs (Q651292) (← links)
• Binary codes from rectangular lattice graphs and permutation decoding (Q854813) (← links)
• On the dual binary codes of the triangular graphs (Q854829) (← links)
• Permutation decoding for binary codes from lattice graphs (Q924975) (← links)
• PD-sets for the codes from incidence matrices of triangular graphs (Q1617766) (← links)
• \(LCD\) codes from adjacency matrices of graphs (Q1647744) (← links)
• Partial permutation decoding for codes from finite planes (Q1775031) (← links)
• Binary codes from graphs on triples (Q1827742) (← links)
• Binary codes of some strongly regular subgraphs of the McLaughlin graph (Q1936495) (← links)
• Codes from incidence matrices of graphs (Q1951220) (← links)
• Hamming graphs and special LCD codes (Q2008071) (← 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)
• A useful tool for constructing linear codes (Q2042936) (← links)
• Optimal antiblocking systems of information sets for the binary codes related to triangular graphs (Q2070265) (← links)
• Hulls of codes from incidence matrices of connected regular graphs (Q2436579) (← links)
• Codes associated with circulant graphs and permutation decoding (Q2436583) (← 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)
• Codes from the line graphs of complete multipartite graphs and PD-sets (Q2643315) (← links)
• Codes from multipartite graphs and minimal permutation decoding sets (Q2788739) (← links)
• Codes from incidence matrices of some Bouwer graphs (Q5013474) (← links)
• Codes from incidence matrices of some regular graphs (Q5013485) (← links)
• Designs and codes from fixed points of alternating groups (Q5067686) (← links)
• Designs and codes from involutions of <i>A_n</i> (Q5089982) (← 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)
• Symmetric 1-designs from PGL2(q), for q an odd prime power (Q5159353) (← links)
• (Q5218271) (← links)
• Codes from incidence matrices of (<i>n</i>, 1)-arrangement graphs and (<i>n</i>, 2)-arrangement graphs (Q5865693) (← links)
• Special \textit{LCD} codes from products of graphs (Q6115436) (← links)