PD-sets for the codes related to some classical varieties
From MaRDI portal
Publication:2569931
DOI10.1016/j.disc.2004.11.020zbMath1087.94024OpenAlexW1978361808MaRDI QIDQ2569931
Hans-Joachim Kroll, Rita Vincenti
Publication date: 24 October 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.11.020
Related Items
Partial permutation decoding for binary linear Hadamard codes, Codes from lattice and related graphs, and permutation decoding, 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, Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1), 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, How to find small AI-systems for antiblocking decoding, Binary codes and partial permutation decoding sets from the Johnson graphs, 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, 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, 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)\), 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, Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\), Linear codes from ruled sets in finite projective spaces, Graphs, designs and codes related to the \(n\)-cube, Binary codes from Paley graphs of prime-power-square order, Binary codes from reflexive uniform subset graphs on 3-sets
Cites Work
