scientific article
From MaRDI portal
Publication:4063038
zbMath0306.94009MaRDI QIDQ4063038
N. V. Semakov, G. V. Zaĭtsev, Victor A. Zinoviev
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Generalized Preparata codes and 2-resolvable Steiner quadruple systems ⋮ On perfect codes that do not contain Preparata-like codes ⋮ On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code ⋮ Inequalities for quasisymmetric designs ⋮ Alphabet-almost-simple 2-neighbour-transitive codes ⋮ Neighbour-transitive codes and partial spreads in generalised quadrangles ⋮ On \(q\)-ary codes with two distances \(d\) and \(d+1\) ⋮ On the classification of completely regular codes with covering radius two and antipodal duals ⋮ On completely regular codes ⋮ On the non-existence of perfect and nearly perfect codes ⋮ Codes from strongly regular \(( \alpha , \beta )\)-reguli ⋮ Characters and Brauer trees of the covering group of ²𝐸₆(2) ⋮ Conway’s groupoid and its relatives ⋮ On non-antipodal binary completely regular codes ⋮ Super-simple designs with \(v\leq 32\) ⋮ Partitioning the planes of \(AG_{2m}(2)\) into 2-designs ⋮ Completely regular codes by concatenating Hamming codes ⋮ On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\) ⋮ Codes projectifs à deux poids, caps complets et ensembles de différences ⋮ \(s\)-elusive codes in Hamming graphs ⋮ On completely regular and completely transitive supplementary codes ⋮ Minimal binary 2-neighbour-transitive codes ⋮ On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate ⋮ Nearly perfect binary codes ⋮ General upper bounds on the minimum size of covering designs ⋮ On the classification of binary completely transitive codes with almost-simple top-group ⋮ Metric coset schemes revisited ⋮ New infinite families of 3-designs from Preparata codes over \(\mathbb{Z}_4\) ⋮ Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\) ⋮ On completely regular binary codes and t-designs∗ ⋮ On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
This page was built for publication:
