We give a construction of an infinite class of doubly even self dual binary codes including a code of length 112. (The study of such a code is closely related to the existence problem of a projective plane of order ten.)
Combinatorial lemma and structure of a class of binary codes
โ Scribed by Al. A. Markov
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1970
- Tongue
- English
- Weight
- 230 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract According to the three classifications of nucleotides, we introduce a sort of binary coding method of RNA secondary structures. On the basis of this representation, we can reduce a RNA secondary structure into three binary digit sequences. We also propose coding rules based on the exclu
The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially
An extension theorem for t-designs is proved. As an application, a class of 4-(4" + 1,5,2) designs is constructed by extending designs related to the 3-designs formed by the minimum weight vectors in the Preparata code of length n = 4", m 2 2. 0 1994 John Wiley & Sons, Inc. ## 1 . INTRODUCTION We