Pages that link to "Item:Q924975"
From MaRDI portal
The following pages link to Permutation decoding for binary codes from lattice graphs (Q924975):
Displaying 12 items.
- Permutation decoding of codes from generalized Paley graphs (Q371247) (← links)
- Codes from lattice and related graphs, and permutation decoding (Q602759) (← links)
- Binary codes from rectangular lattice graphs and permutation decoding (Q854813) (← links)
- Binary codes from the line graph of the \(n\)-cube (Q975825) (← links)
- Partial permutation decoding for codes from finite planes (Q1775031) (← links)
- Binary codes of some strongly regular subgraphs of the McLaughlin graph (Q1936495) (← links)
- On the existence of PD-sets: algorithms arising from automorphism groups of codes (Q2025365) (← links)
- Quadratic residue codes, rank three groups and PBIBDs (Q2109385) (← links)
- Hulls of codes from incidence matrices of connected regular graphs (Q2436579) (← links)
- Codes associated with circulant graphs and permutation decoding (Q2436583) (← 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)
