Recommendations
Cited in
(92)- A modification of the Zinoviev lower bound for constant weight codes
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
- Some lower bounds for constant weight codes
- On the maximum cardinality of binary constant weight codes with prescribed distance
- Strong qualitative independence.
- Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
- Uniquely \(K_r^{(k)}\)-saturated hypergraphs
- Oriented incidence colourings of digraphs
- A note on the size of \(\mathscr{N}\)-free families
- How many delta-matroids are there?
- Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six
- Asymptotics of symmetry in matroids
- Forbidden subposet problems for traces of set families
- On the number of bases of almost all matroids
- Multiset combinatorial batch codes
- Bounds on the sizes of constant weight covering codes
- New lower bounds for the Hadwiger numbers of \(\ell_p\) balls for \(p<2\)
- New type of coding problem motivated by database theory
- Nonabelian sets with distinct k-sums
- On the chromatic number, colorings, and codes of the Johnson graph
- A note on the growth of the dimension in complete simple games
- Matroids are not Ehrhart positive
- Edge-transitive token graphs
- On the volume of unit balls of finite-dimensional Lorentz spaces
- Entropy numbers of finite-dimensional embeddings
- Counting matroids in minor-closed classes
- Bounds on permutation codes of distance four
- Matroidal bijections between graphs
- Geometry of gross substitutes valuations
- On the number of containments in \(P\)-free families
- Two-weight codes: upper bounds and new optimal constructions
- New theoretical bounds and constructions of permutation codes under block permutation metric
- New explicit binary constant weight codes from Reed-Solomon codes
- Regularity and planarity of token graphs
- A geometric approach to finding new lower bounds of A(n,d,w)
- No four subsets forming an \(N\)
- Largest families without an \(r\)-fork
- A new table of constant weight codes of length greater than 28
- Upper bounds for constant-weight codes
- Graph theoretic methods in coding theory
- scientific article; zbMATH DE number 5914949 (Why is no real title available?)
- Coding theory motivated by relational databases
- Non-defectivity of Grassmannians of planes
- On the number of matroids
- scientific article; zbMATH DE number 431468 (Why is no real title available?)
- A new table of constant weight codes
- scientific article; zbMATH DE number 3885791 (Why is no real title available?)
- Fixed points of Boolean networks, guessing graphs, and coding theory
- New lower bounds for constant weight codes
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- A PROBLEM FOR ABELIAN GROUPS
- scientific article; zbMATH DE number 3985112 (Why is no real title available?)
- Sperner type theorems with excluded subposets
- On Additive Bases and Harmonious Graphs
- Upper bounds on the cardinality of a binary code with a given minimum distance
- A lower bound for ternary constant weight codes
- Maximum disjoint bases and constant-weight codes
- Doubly exponentially many ingleton matroids
- Flavors of compressive sensing
- On (n, k, l, Δ)-systems
- On the number of matroids compared to the number of sparse paving matroids
- Enumerating matroids of fixed rank
- scientific article; zbMATH DE number 7274073 (Why is no real title available?)
- Hamiltonicity of token graphs of fan graphs
- Approximation limitations of pure dynamic programming
- Secret sharing schemes for ports of matroids of rank 3.
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- An upper bound for binary constant weight codes
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor
- Private information retrieval with result verification for more servers
- Balanced reconstruction codes for single edits
- Independent domination in the graph defined by two consecutive levels of the \(n\)-cube
- Valuative invariants for large classes of matroids
- Approximate generalized Steiner systems and near-optimal constant weight codes
- Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
- A Graham-Sloane type construction for \(s\)-surjective matrices
- Face enumeration for split matroid polytopes
- Asymptotically optimal constant weight codes with even distance
- The asymptotic uniform distribution of subset sums
- On the clique covering numbers of Johnson graphs
- A note on the asymptotic value of the isoperimetric number of J(n, 2)
- Sizes of flat maximal antichains of subsets
- Differentially private Assouad, Fano, and Le Cam
- Visibility in hypercubes
- Some exact and asymptotic results for hypergraph Turán problems in _2-norm
- Entropy and sampling numbers of classes of ridge functions
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Sets in Abelian groups with distinct sums of pairs.
- Exact forbidden subposet results using chain decompositions of the cycle
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
This page was built for publication: Lower bounds for constant weight codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3884014)
