Partial permutation decoding for simplex codes
From MaRDI portal
Publication:394838
DOI10.3934/amc.2012.6.505zbMath1282.94089OpenAlexW2039133144MaRDI QIDQ394838
Washiela Fish, Eric Mwambene, Jennifer D. Key
Publication date: 28 January 2014
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2012.6.505
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Eulerian and Hamiltonian graphs (05C45)
Related Items
Partial permutation decoding for binary linear Hadamard codes, Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes, Codes associated with the odd graphs, Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even, Partial permutation decoding and PD-sets for \(\mathbb{Z}_{p^s}\)-linear generalized Hadamard codes, Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes, Partial permutation decoding for MacDonald codes, Improved partial permutation decoding for Reed-Muller codes, Comparing decoding methods for quaternary linear codes, On linear codes admitting large automorphism groups, On the existence of PD-sets: algorithms arising from automorphism groups of codes
