To the theory of \(q\)-ary Steiner and other-type trades
From MaRDI portal
Publication:897311
DOI10.1016/j.disc.2015.11.002zbMath1328.05025arXiv1412.3792OpenAlexW1928275009MaRDI QIDQ897311
Ivan Yu. Mogilnykh, Denis S. Krotov, Vladimir N. Potapov
Publication date: 17 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3792
Related Items (24)
On a correspondence between maximal cliques in Paley graphs of square order ⋮ Minimum supports of eigenfunctions of graphs: a survey ⋮ Minimum supports of eigenfunctions of Johnson graphs ⋮ On eigenfunctions and maximal cliques of Paley graphs of square order ⋮ MMS-type problems for Johnson scheme ⋮ Minimum supports of eigenfunctions in bilinear forms graphs ⋮ The minimum volume of subspace trades ⋮ Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs ⋮ Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ On the cardinality spectrum and the number of Latin bitrades of order 3 ⋮ A new series of large sets of subspace designs over the binary field ⋮ Optimal functions with spectral constraints in hypercubes ⋮ On eigenfunctions and maximal cliques of generalised Paley graphs of square order ⋮ Inclusion matrices for rainbow subsets ⋮ Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs ⋮ 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 ⋮ Minimum supports of eigenfunctions of Hamming graphs ⋮ On existence of perfect bitrades in Hamming graphs ⋮ The extended 1-perfect trades in small hypercubes ⋮ Minimal solutions of the isometry equation ⋮ \(PI\)-eigenfunctions of the Star graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional Latin bitrades
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Large sets of subspace designs
- On weight distributions of perfect colorings and completely regular codes
- Switching codes and designs
- Delsarte clique graphs
- On the structure of (v,k,t) trades
- Combinatorial designs and algebras
- On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\)
- On the structure of non-full-rank perfect \(q\)-ary codes
- On the number of maximum independent sets in Doob graphs
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- The theory and application of latin bitrades: A survey
- Coding for Errors and Erasures in Random Network Coding
- Perfect binary codes: constructions, properties, and enumeration
- On the number of n-ary quasigroups of finite order
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
- On the number of inequivalent steiner triple systems
This page was built for publication: To the theory of \(q\)-ary Steiner and other-type trades
