Publication:4119093
From MaRDI portal
zbMath0348.94016MaRDI QIDQ4119093
Publication date: 1972
Related Items
What is known about unit cubes, Local spectra of perfect binary codes, On the minimum average distance of binary codes: Linear programming approach, Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\), Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\), On the minimum average distance of binary constant weight codes, On the construction of \(q\)-ary equidistant codes, On the nonbinary Johnson scheme, Upper bounds for the cardinality of s-distances codes, Algebraic theory of block codes detecting independent errors, Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound, Unrestricted codes with the Golay parameters are unique, Alternating bilinear forms over GF(q), A linear programming problem in harmonic analysis, Bilinear forms over a finite field, with applications to coding theory, Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications, Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\), Dual codes of systematic group codes over abelian groups, Quasi-symmetric designs and codes meeting the Grey-Rankin bound, A minimal design of order 11 on the 3-sphere, On the variance of average distance of subsets in the Hamming space, A direct approach to linear programming bounds for codes and tms-nets, On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions, Improved Delsarte bounds for spherical codes in small dimensions, A note on the stability number of an orthogonality graph
