Codes from multipartite graphs and minimal permutation decoding sets

DOI10.1142/S1793830915500603zbMath1371.94692MaRDI QIDQ2788739

No author found.

Publication date: 22 February 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

codesPD-setscomplete multipartite-graphminimal permutation decoding sets

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial codes (94B25)

Related Items (3)

Generation of the symmetric group Sn2 ⋮ Codes from incidence matrices of some Bouwer graphs ⋮ Codes from incidence matrices of some regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Permutation decoding for binary codes from lattice graphs
• Permutation decoding for the binary codes from triangular graphs.
• Binary codes of strongly regular graphs
• On coverings
• A permutation decoding of the (24, 12, 8) Golay code (Corresp.)
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes

This page was built for publication: Codes from multipartite graphs and minimal permutation decoding sets