scientific article
From MaRDI portal
Publication:3888971
zbMath0444.94025MaRDI QIDQ3888971
No author found.
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
A survey of partial difference sets ⋮ Distance-regular graphs of Hamming type ⋮ The application of invariant theory to the existence of quasi-symmetric designs ⋮ On the number of \(q\)-ary quasi-perfect codes with covering radius 2 ⋮ The uniformly packed binary \([27, 21, 3 \) and \([35, 29, 3 ]\) codes] ⋮ A note on binary completely regular codes with large minimum distance ⋮ On the classification of completely regular codes with covering radius two and antipodal duals ⋮ On tilings of the binary vector space ⋮ New families of completely regular codes and their corresponding distance regular coset graphs ⋮ Completely regular codes and completely transitive codes ⋮ On completely regular codes ⋮ On new completely regular \(q\)-ary codes ⋮ Characters and Brauer trees of the covering group of ²𝐸₆(2) ⋮ Conway’s groupoid and its relatives ⋮ Diagonally neighbour transitive codes and frequency permutation arrays ⋮ On non-antipodal binary completely regular codes ⋮ On \(r\)-partition designs in Hamming spaces ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ Dual distances of completely regular codes ⋮ Completely regular codes by concatenating Hamming codes ⋮ Codes projectifs à deux poids, caps complets et ensembles de différences ⋮ On completely regular and completely transitive supplementary codes ⋮ Self-dual codes over GF(4) ⋮ Classification of a class of distance-regular graphs via completely regular codes ⋮ An Erdős-Ko-Rado theorem for regular intersecting families of octads ⋮ On perfect and Reed-Muller codes over finite fields ⋮ A new distance-regular graph of diameter 3 on 1024 vertices ⋮ Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\) ⋮ On triple-sum-sets and two or three weights codes ⋮ On completely regular binary codes and t-designs∗ ⋮ On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\) ⋮ A class of codes admitting at most three nonzero dual distances
This page was built for publication:
