Permutation Decoding of Systematic Codes
From MaRDI portal
Recommendations
Cited in
(69)- Partial permutation decoding for the first-order Reed-Muller codes
- Graphs, designs and codes related to the n-cube
- New approaches to reduced-complexity decoding
- Permutation decoding for the binary codes from triangular graphs.
- PD-sets for the codes from incidence matrices of triangular graphs
- Binary codes and permutation decoding sets from the graph products of cycles
- Partial permutation decoding for codes from finite planes
- Duadic group algebra codes
- Codes from incidence matrices of graphs
- Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- \(s\)-PD-sets for codes from projective planes \(\mathrm{PG}(2,2^h)\), \(5\leq h\leq 9\)
- Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
- Construction of binary Hadamard codes and their \(s\)-PD sets
- Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
- Binary codes and partial permutation decoding sets from the odd graphs
- Decoding mixed errors and erasures in permutation codes
- Codes from the incidence matrices of graphs on 3-sets
- Binary codes from reflexive uniform subset graphs on 3-sets
- Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes
- Information sets in abelian codes: defining sets and Groebner basis
- Hulls of codes from incidence matrices of connected regular graphs
- Codes associated with circulant graphs and permutation decoding
- Antiblocking systems and PD-sets
- Information sets and partial permutation decoding for codes from finite geometries
- Codes from the line graphs of complete multipartite graphs and PD-sets
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
- New advances in permutation decoding of first-order Reed-Muller codes
- Codes from multipartite graphs and minimal permutation decoding sets
- Partial permutation decoding for binary linear Hadamard codes
- New permutation codes using Hadamard unscrambling (Corresp.)
- Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
- Permutation decoding of codes from generalized Paley graphs
- Codes associated with the odd graphs
- Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes
- Permutation decoding of abelian codes
- scientific article; zbMATH DE number 1135092 (Why is no real title available?)
- Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes
- Binary codes and partial permutation decoding sets from the Johnson graphs
- Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes
- Codes from incidence matrices of some Bouwer graphs
- Codes from incidence matrices of some regular graphs
- Partial permutation decoding for MacDonald codes
- Improved partial permutation decoding for Reed-Muller codes
- Systematic Encoding and Permutation Decoding for Zps-Linear Codes
- Linear codes resulting from finite group actions
- Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs (2k, k, k + 1, 1)
- PD-sets for codes related to flag-transitive symmetric designs
- On linear codes admitting large automorphism groups
- Conjectural permutation decoding of some AG codes
- Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
- Codes from lattice and related graphs, and permutation decoding
- Special \textit{LCD} codes from products of graphs
- Distance-regular graphs and new block designs obtained from the Mathieu groups
- Partial permutation decoding and PD-sets for \(\mathbb{Z}_{p^s}\)-linear generalized Hadamard codes
- Some algebraic questions about the Reed-Muller code
- Codes and designs from triangular graphs and their line graphs
- How to find small AI-systems for antiblocking decoding
- A McEliece cryptosystem using permutation codes
- Decoding algorithms in group codes
- Designer of codes: a tribute to Jennifer Key
- Reed-Muller codes and permutation decoding
- On binary codes that are maximal totally isotropic subspaces with respect to an alternating form
- Minimum-size s-PD sets in partial permutation decoding with applications to cyclic and quasi-cyclic codes
- Binary codes from rectangular lattice graphs and permutation decoding
- Permutation decoding for binary codes from lattice graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Binary codes from the line graph of the \(n\)-cube
- Antiblocking decoding
This page was built for publication: Permutation Decoding of Systematic Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5726081)
