Codes from multipartite graphs and minimal permutation decoding sets
From MaRDI portal
Recommendations
- Permutation decoding for codes from designs, finite geometries and graphs
- Permutation decoding for the binary codes from triangular graphs.
- Partial permutation decoding for binary linear Hadamard codes
- Partial permutation decoding for codes from affine geometry designs
- Binary codes from graphs on triples and permutation decoding
Cites work
- A permutation decoding of the (24, 12, 8) Golay code (Corresp.)
- Binary codes of strongly regular graphs
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On coverings
- Permutation decoding for binary codes from lattice graphs
- Permutation decoding for the binary codes from triangular graphs.
- Permutation Decoding of Systematic Codes
Cited in
(12)- \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\)
- Antiblocking systems and PD-sets
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
- Partial permutation decoding for binary linear Hadamard codes
- Permutation decoding for codes from designs, finite geometries and graphs
- Permutation decoding of codes from generalized Paley graphs
- Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
- Codes from incidence matrices of some Bouwer graphs
- Codes from incidence matrices of some regular graphs
- Generation of the symmetric group \(S_{n^2}\)
- Comparing decoding methods for quaternary linear codes
- Codes from lattice and related graphs, and permutation decoding
This page was built for publication: Codes from multipartite graphs and minimal permutation decoding sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2788739)
