
doi: 10.1007/bf00268141
In this paper we give sharp bounds for the block-length n of optimal linear (n, k)-codes over GF(q).
Combinatorial aspects of finite geometries, General theory of nonlinear incidence geometry, Theory of error-correcting codes and error-detecting codes
Combinatorial aspects of finite geometries, General theory of nonlinear incidence geometry, Theory of error-correcting codes and error-detecting codes
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
