The following pages link to (Q4119093):
Displayed 25 items.
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (Q686527) (← links)
- On the minimum average distance of binary constant weight codes (Q932637) (← links)
- On the construction of \(q\)-ary equidistant codes (Q941879) (← links)
- On the nonbinary Johnson scheme (Q1066117) (← links)
- Upper bounds for the cardinality of s-distances codes (Q1077373) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound (Q1167704) (← links)
- Unrestricted codes with the Golay parameters are unique (Q1218393) (← links)
- Alternating bilinear forms over GF(q) (Q1232530) (← links)
- A linear programming problem in harmonic analysis (Q1241388) (← links)
- Bilinear forms over a finite field, with applications to coding theory (Q1254279) (← links)
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications (Q1292857) (← links)
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\) (Q1328436) (← links)
- Dual codes of systematic group codes over abelian groups (Q1352429) (← links)
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound (Q1356042) (← links)
- A minimal design of order 11 on the 3-sphere (Q1585650) (← links)
- On the variance of average distance of subsets in the Hamming space (Q1765526) (← links)
- A direct approach to linear programming bounds for codes and tms-nets (Q2383988) (← links)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions (Q2469466) (← links)
- Improved Delsarte bounds for spherical codes in small dimensions (Q2642026) (← links)
- A note on the stability number of an orthogonality graph (Q2643845) (← links)
- What is known about unit cubes (Q4663501) (← links)
- Local spectra of perfect binary codes (Q4936734) (← links)
- On the minimum average distance of binary codes: Linear programming approach (Q5939230) (← links)
- Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\) (Q5942008) (← links)