Binary codes and partial permutation decoding sets from the Johnson graphs

DOI10.1007/s00373-014-1485-2zbMath1336.94085OpenAlexW2043253969MaRDI QIDQ497331

Washiela Fish

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1485-2

zbMATH Keywords

automorphism groupbinary codesJohnson graphspermutation decoding

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Other designs, configurations (05B30) Group actions on combinatorial structures (05E18)

Related Items

Codes from adjacency matrices of uniform subset graphs ⋮ Hamming graphs and special LCD codes ⋮ On the existence of PD-sets: algorithms arising from automorphism groups of codes

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
• Hamiltonian uniform subset graphs
• Permutation decoding for the binary codes from triangular graphs.
• Binary codes from graphs on triples
• PD-sets for the codes related to some classical varieties
• Permutation Decoding of Systematic Codes

This page was built for publication: Binary codes and partial permutation decoding sets from the Johnson graphs