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