Permutation Decoding of Systematic Codes
From MaRDI portal
Publication:5726081
DOI10.1002/j.1538-7305.1964.tb04075.xzbMath0116.35304OpenAlexW2070442620MaRDI QIDQ5726081
Publication date: 1964
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1964.tb04075.x
Related Items
Construction of binary Hadamard codes and their \(s\)-PD sets, PD-sets for the codes from incidence matrices of triangular graphs, Partial permutation decoding for binary linear Hadamard codes, Binary codes from rectangular lattice graphs and permutation decoding, Codes from the line graphs of complete multipartite graphs and PD-sets, Duadic group algebra codes, Permutation decoding of codes from generalized Paley graphs, Codes from lattice and related graphs, and permutation decoding, Partial permutation decoding for binary linear and \(\mathbb Z_4\)-linear Hadamard codes, Codes associated with the odd graphs, Binary codes and permutation decoding sets from the graph products of cycles, Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even, Special \textit{LCD} codes from products of graphs, Distance-regular graphs and new block designs obtained from the Mathieu groups, Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1), Partial permutation decoding and PD-sets for \(\mathbb{Z}_{p^s}\)-linear generalized Hadamard codes, Some algebraic questions about the Reed-Muller code, Codes from incidence matrices of graphs, 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, New advances in permutation decoding of first-order Reed-Muller codes, Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs, Permutation decoding for the binary codes from triangular graphs., Codes and designs from triangular graphs and their line graphs, Permutation decoding for binary codes from lattice graphs, How to find small AI-systems for antiblocking decoding, New approaches to reduced-complexity decoding, Binary codes and partial permutation decoding sets from the Johnson graphs, Permutation decoding of \(\mathbb Z_2{\mathbb Z}_4\)-linear codes, Partial permutation decoding for MacDonald codes, Antiblocking systems and PD-sets, Improved partial permutation decoding for Reed-Muller codes, On linear codes admitting large automorphism groups, Binary codes and partial permutation decoding sets from the odd graphs, Linear codes resulting from finite group actions, Codes from incidence matrices and line graphs of Hamming graphs, Information sets and partial permutation decoding for codes from finite geometries, Binary codes from the line graph of the \(n\)-cube, Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\), Partial permutation decoding for codes from finite planes, Reed-Muller codes and permutation decoding, Codes from the incidence matrices of graphs on 3-sets, Antiblocking decoding, 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\), Codes from multipartite graphs and minimal permutation decoding sets, PD-sets for codes related to flag-transitive symmetric designs, Partial permutation decoding for the first-order Reed-Muller codes, Graphs, designs and codes related to the \(n\)-cube, Codes from incidence matrices of some Bouwer graphs, Codes from incidence matrices of some regular graphs, Binary codes from reflexive uniform subset graphs on 3-sets, Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
