scientific article; zbMATH DE number 2232233
From MaRDI portal
Publication:5707657
Recommendations
Cited in
(only showing first 100 items - show all)- Linear codes on posets with extension property
- A Cheeger inequality of a distance regular graph using Green's function
- On a family of binary completely transitive codes with growing covering radius
- On existence of two symbol complete orthogonal arrays
- On relative \(t\)-designs in polynomial association schemes
- Polar spaces, generalized hexagons and perfect codes
- On the covering radius of an unrestricted code as a function of the rate and dual distance
- On Jackson's theorem in the space \(\ell_2(\mathbb{Z}_2^n)\)
- \(\mathbb{Z}_4\mathbb{Z}_4 [u]\)-additive cyclic and constacyclic codes
- On distance distributions of orthogonal arrays
- Codes, cubes, and graphical designs
- Idempotent systems and character algebras
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- Stability for 1-intersecting families of perfect matchings
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- An extension of the Erdős-Ko-Rado theorem to uniform set partitions
- Perfect codes in the discrete simplex
- On the classification of completely regular codes with covering radius two and antipodal duals
- A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\)
- New examples of Euclidean tight 4-designs
- On Integrality in Semidefinite Programming for Discrete Optimization
- Addressing graph products and distance-regular graphs
- McFarland's conjecture on abelian difference sets with multiplier \(-1\)
- A family of nonbinary linear codes
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
- Dual bounds for the positive definite functions approach to mutually unbiased bases
- On the spectral gap and the automorphism group of distance-regular graphs
- Invariant codes, difference schemes, and distributive quasigroups
- Diameter bounds for geometric distance-regular graphs
- On the regularity of perfect 2-colorings of the Johnson graph
- New inequalities for q-ary constant-weight codes
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
- The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time
- Near-bipartite Leonard pairs
- Linear programming bounds for balanced arrays
- Partitions into perfect codes in the Hamming and Lee metrics
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- Local distributions for eigenfunctions and perfect colorings of q-ary Hamming graph
- On two-weight \(\mathbb {Z}_{2^k}\)-codes
- Hamming graphs in Nomura algebras
- One weight \(\mathbb {Z}_2\mathbb {Z}_4\) additive codes
- Association schemes on general measure spaces and zero-dimensional abelian groups
- The homogeneous weight partition and its character-theoretic dual
- A tribute to Dennis Stanton
- New explicit bounds for ordered codes and \((t,m,s)\)-nets
- Optimal measures for \(p\)-frame energies on spheres
- Anticodes in the sum-rank metric
- One more proof of the first linear programming bound for binary codes and two conjectures
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Inequalities for t designs
- Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes
- Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields
- \(\mathbb{F}_qR\)-linear skew constacyclic codes and their application of constructing quantum codes
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- Formally self-dual LCD codes from two-class association schemes
- On non-antipodal binary completely regular codes
- A new upper bound on nonbinary block codes
- The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
- Some implications on amorphic association schemes
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
- On Rank and Kernel of ℤ4-Linear Codes
- Weighted permutation problems and Laguerre polynomials
- Intriguing sets of vertices of regular graphs
- Quantum walks on simplexes and multiple perfect state transfer
- Pseudocyclic association schemes and strongly regular graphs
- Alphabet-almost-simple 2-neighbour-transitive codes
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Transitivity in finite general linear groups
- Totient-numbers of the rectangular association scheme
- On a class of binary linear completely transitive codes with arbitrary covering radius
- On pseudo-automorphisms and fusions of an association scheme
- On \(q\)-ary codes with two distances \(d\) and \(d+1\)
- The minimum distance of some narrow-sense primitive BCH codes
- The chromatic number of the q-Kneser graph for large q
- Complex spherical designs and codes
- Partitions of Frobenius rings induced by the homogeneous weight
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- Kravchuk matrices and induced operators on Clifford algebras
- On \((v,k,\lambda{})\) graphs and designs with trivial automorphism group
- The subconstituent algebra of an association scheme. I
- Association Schemes, Orthogonal Arrays and Codes from Non‐Degenerate Quadrics and Hermitian Varieties in Finite Projective Geometries
- MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)
- Conway's groupoid and its relatives
- Spectrum of Johnson graphs
- Completely regular designs of strength one
- Regular intersecting families
- Subschemes of some association schemes
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- Geometric aspects of 2-walk-regular graphs
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- A simple proof of the Delsarte inequalities
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Parameters of association schemes that are both P- and Q-polynomial
- A bivariate \(Q\)-polynomial structure for the non-binary Johnson scheme
- On the automorphism groups of rank-4 primitive coherent configurations
- Quantum isomorphism of graphs from association schemes
- Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\)
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5707657)
