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