PD-sets for the codes related to some classical varieties
From MaRDI portal
Publication:2569931
DOI10.1016/j.disc.2004.11.020zbMath1087.94024MaRDI 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
94B05: Linear codes (general theory)
Related Items
Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1), Linear codes resulting from finite group actions, Special \textit{LCD} codes from products of graphs, Partial permutation decoding for binary linear Hadamard codes, Codes associated with the odd graphs, Binary codes and partial permutation decoding sets from the Johnson graphs, Partial permutation decoding for MacDonald codes, Improved partial permutation decoding for Reed-Muller codes, On linear codes admitting large automorphism groups, Codes from lattice and related graphs, and permutation decoding, How to find small AI-systems for antiblocking decoding, Reed-Muller codes and permutation decoding, Codes from incidence matrices and line graphs of Hamming graphs, Binary codes from the line graph of the \(n\)-cube, Antiblocking decoding, Graphs, designs and codes related to the \(n\)-cube, Binary codes and permutation decoding sets from the graph products of cycles, 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, Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\), Binary codes and partial permutation decoding sets from the odd graphs, Codes from the incidence matrices of graphs on 3-sets, Linear codes from ruled sets in finite projective spaces, Binary codes from Paley graphs of prime-power-square order, Binary codes from reflexive uniform subset graphs on 3-sets, Information sets in abelian codes: defining sets and Groebner basis, Hulls of codes from incidence matrices of connected regular graphs, 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)\), Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
Cites Work
