We study pairs of binary linear codes Cl(n, nR1), C2(n, nR 2) with the property that for any nonzero cl c C~ and c2~ C 2, there are coordinates in which both c, and c 2 are nonzero.
Linear binary codes with intersection properties
✍ Scribed by D. Miklós
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 574 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Given an (n, k) linear code C over GF(q), the intersection of C with a code ?(C), where ? # S n , is an (n, k 1 ) code, where max[0, 2k&n] k 1 k. The intersection problem is to determine which integers in this range are attainable for a given code C. We show that, depending on the structure of the g
## Abstract In quantum information theory, superadditivity in the capacity of a quantum channel occurs as a special property. We present a method of calculating the mutual information analytically for binary linear codes by using square‐root measurement as the decoding process. Many examples of cod