Anticodes for the Grassmann and bilinear forms graphs

DOI10.1007/BF01390772zbMath0852.94021MaRDI QIDQ1894271

Yanyan Li

Publication date: 2 December 1996

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

Grassmann graphsbilinear forms graphsDelsarte's anticode condition

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (18)

Spectral properties of Cayley graphs over \(M_{m \times n}(F_q)\) ⋮ Perfect codes in Doob graphs ⋮ Constructions of Sidon spaces and cyclic subspace codes ⋮ Unnamed Item ⋮ Linearity and complements in projective space ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ Further constructions of large cyclic subspace codes via Sidon spaces ⋮ Matrix graphs and MRD codes over finite principal ideal rings ⋮ New constructions of Sidon spaces and large cyclic constant dimension codes ⋮ 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 ⋮ A new approach for examining \(q\)-Steiner systems ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ A family of linear codes from constant dimension subspace codes ⋮ Perfect codes in the discrete simplex ⋮ Codes and anticodes in the Grassman graph ⋮ Optimal tristance anticodes in certain graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the existence of perfect constant weight codes
• Subspaces, subsets, and partitions
• On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
• Orthogonal Polynomials, Duality and Association Schemes

This page was built for publication: Anticodes for the Grassmann and bilinear forms graphs