The minimum volume of subspace trades

DOI10.1016/j.disc.2017.08.012zbMath1370.05035arXiv1512.02592OpenAlexW2270759269MaRDI QIDQ2404357

Denis S. Krotov

Publication date: 18 September 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.02592

zbMATH Keywords

subspace designstradesbitrades

Mathematics Subject Classification ID

Designs and configurations (05B99)

Related Items (6)

A new series of large sets of subspace designs over the binary field ⋮ Inclusion matrices for rainbow subsets ⋮ Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph ⋮ Minimum supports of functions on the Hamming graphs with spectral constraints ⋮ Large sets of subspace designs ⋮ Minimal solutions of the isometry equation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large sets of subspace designs
• On weight distributions of perfect colorings and completely regular codes
• Switching codes and designs
• On embeddings of Grassmann graphs in polar Grassmann graphs
• To the theory of \(q\)-ary Steiner and other-type trades
• On the structure of (v,k,t) trades
• On the support size of null designs of finite ranked posets
• Minimal null designs of subspace lattices over finite fields
• On the number of sets in a null t-design
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS

This page was built for publication: The minimum volume of subspace trades