Minimal permutation sets for decoding the binary Golay codes (Corresp.)
From MaRDI portal
Publication:3937290
DOI10.1109/TIT.1982.1056504zbMath0479.94021MaRDI QIDQ3937290
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
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, 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, 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), Codes from incidence matrices of graphs, Hulls of codes from incidence matrices of connected regular graphs, New advances in permutation decoding of first-order Reed-Muller codes, 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, Partial permutation decoding for MacDonald codes, Antiblocking systems and PD-sets, PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\), Improved partial permutation decoding for Reed-Muller codes, On linear codes admitting large automorphism groups, 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, Generalized covering designs and clique coverings, Binary codes from Paley graphs of prime-power-square order, PD-sets for the codes related to some classical varieties, Binary codes from reflexive uniform subset graphs on 3-sets
