Lower bounds for constant weight codes
From MaRDI portal
Publication:3884014
DOI10.1109/TIT.1980.1056141zbMath0441.94012OpenAlexW2011638021MaRDI QIDQ3884014
N. J. A. Sloane, Ronald L. 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
Related Items (60)
On Additive Bases and Harmonious Graphs ⋮ New explicit binary constant weight codes from Reed-Solomon codes ⋮ Regularity and planarity of token graphs ⋮ Uniquely \(K_r^{(k)}\)-saturated hypergraphs ⋮ New type of coding problem motivated by database theory ⋮ Oriented incidence colourings of digraphs ⋮ Matroids are not Ehrhart positive ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Some lower bounds for constant weight codes ⋮ On the number of matroids ⋮ Nonabelian sets with distinct \(k\)-sums ⋮ Doubly Exponentially Many Ingleton Matroids ⋮ Edge-transitive token graphs ⋮ Sets in Abelian groups with distinct sums of pairs. ⋮ On the chromatic number, colorings, and codes of the Johnson graph ⋮ A note on the size of \(\mathscr{N}\)-free families ⋮ Sperner type theorems with excluded subposets ⋮ The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\) ⋮ On the volume of unit balls of finite-dimensional Lorentz spaces ⋮ How many delta-matroids are there? ⋮ Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor ⋮ Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) ⋮ No four subsets forming an \(N\) ⋮ Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six ⋮ Exact forbidden subposet results using chain decompositions of the cycle ⋮ A PROBLEM FOR ABELIAN GROUPS ⋮ Flavors of Compressive Sensing ⋮ Strong qualitative independence. ⋮ Asymptotics of symmetry in matroids ⋮ Sets in \(\mathbb{Z}_n\) with distinct sums of pairs. ⋮ Entropy numbers of finite-dimensional embeddings ⋮ On the number of matroids compared to the number of sparse paving matroids ⋮ Largest families without an \(r\)-fork ⋮ Enumerating matroids of fixed rank ⋮ Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\) ⋮ A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ Counting matroids in minor-closed classes ⋮ Bounds on permutation codes of distance four ⋮ A note on the growth of the dimension in complete simple games ⋮ Matroidal bijections between graphs ⋮ Forbidden subposet problems for traces of set families ⋮ On the number of bases of almost all matroids ⋮ Hamiltonicity of token graphs of fan graphs ⋮ Geometry of gross substitutes valuations ⋮ Multiset combinatorial batch codes ⋮ On the number of containments in \(P\)-free families ⋮ On (n, k, l, Δ)-systems ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Bounds on the sizes of constant weight covering codes ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Approximation Limitations of Pure Dynamic Programming ⋮ Entropy and sampling numbers of classes of ridge functions ⋮ New lower bounds for the Hadwiger numbers of \(\ell_p\) balls for \(p<2\) ⋮ Coding Theory Motivated by Relational Databases ⋮ Two-weight codes: upper bounds and new optimal constructions ⋮ Non-defectivity of Grassmannians of planes ⋮ New theoretical bounds and constructions of permutation codes under block permutation metric ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ Extremal problems whose solutions are the blowups of the small Witt- designs ⋮ A modification of the Zinoviev lower bound for constant weight codes
This page was built for publication: Lower bounds for constant weight codes
