Codes and anticodes in the Grassman graph
From MaRDI portal
Publication:1604569
DOI10.1006/jcta.2001.3188zbMath1006.94028OpenAlexW1996897280MaRDI QIDQ1604569
Publication date: 4 July 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2001.3188
Related Items (28)
Constructions of Sidon spaces and cyclic subspace codes ⋮ Bounds on subspace codes based on totally isotropic subspaces in unitary spaces ⋮ Total perfect codes in Cayley graphs ⋮ Unnamed Item ⋮ Linearity and complements in projective space ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ Constructions of large cyclic constant dimension codes via Sidon spaces ⋮ Further constructions of large cyclic subspace codes via Sidon spaces ⋮ New constructions of Sidon spaces and large cyclic constant dimension codes ⋮ Perfect codes in vertex-transitive graphs ⋮ Perfect Codes in Cayley Graphs ⋮ Galois geometries and coding theory ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields ⋮ Constructions of cyclic constant dimension codes ⋮ Covering of subspaces by subspaces ⋮ Residual \(q\)-Fano planes and related structures ⋮ A new approach for examining \(q\)-Steiner systems ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ Error-correcting codes in attenuated space over finite fields ⋮ Derived and residual subspace designs ⋮ Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 ⋮ Further constructions of cyclic subspace codes ⋮ Johnson type bounds on constant dimension codes ⋮ A family of linear codes from constant dimension subspace codes ⋮ Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space ⋮ Optimal tristance anticodes in certain graphs
Cites Work
This page was built for publication: Codes and anticodes in the Grassman graph
