Maximally Connected Arrays on the n-Cube
From MaRDI portal
Publication:5539520
DOI10.1137/0115129zbMath0157.26004MaRDI QIDQ5539520
Publication date: 1967
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0115129
94B05: Linear codes (general theory)
Related Items
Polytopes, graphs, and complexes, Sets of Lattice Points which Contain a Maximal Number of Edges, Note on an extremal problem arising for unreliable networks in parallel computing, Isoperimetric inequalities for faces of the cube and the grid, Exact face-isoperimetric inequalities, Edge-isoperimetric inequalities in the grid, Contributions to the geometry of Hamming spaces, A finite-dimensional normed space with two non-equivalent symmetric bases, Matchings and paths in the cube, The optimal number of faces in cubical complexes