Some new distance-4 constant weight codes
From MaRDI portal
Publication:644316
DOI10.3934/amc.2011.5.417zbMath1248.94127OpenAlexW2157775853MaRDI QIDQ644316
Tuvi Etzion, Andries E. Brouwer
Publication date: 3 November 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2011.5.417
Association schemes, strongly regular graphs (05E30) Other types of codes (94B60) Coloring of graphs and hypergraphs (05C15)
Related Items
New explicit binary constant weight codes from Reed-Solomon codes, Matroids are not Ehrhart positive, On the number of matroids, Large sets of \(t\)-designs over finite fields exist for all \(t\), On the Connectivity of Token Graphs of Trees, Large cycles in generalized Johnson graphs, A new construction for \(q\)-ary constant weight codes, EXISTENCE OF -ANALOGS OF STEINER SYSTEMS, Optimal binary constant weight codes and affine linear groups over finite fields, Independence and matching numbers of some token graphs, A distributed computing perspective of unconditionally secure information transmission in Russian cards problems, The edge-connectivity of token graphs, A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
