The theory of error-correcting codes
β Scribed by M.K Kerimov
- Publisher
- Elsevier Science
- Year
- 1980
- Weight
- 68 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We study the hamiltonicity of certain graphs obtained from the hypercube as a means of producing a binary code of distance two and length __n__, whose codewords are ordered so that for each two consecutive codewords, one dominates the other. One vector __dominates__ the other, if and on
In this paper we use intersection theory to develop methods for obtaining lower bounds on the parameters of algebraic geometric error-correcting codes constructed from varieties of arbitrary dimension. The methods are su$ciently general to encompass many of the codes previously constructed from high