𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear intersecting codes

✍ Scribed by Gérard Cohen; Abraham Lempel

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
358 KB
Volume
56
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Intersection of Isomorphic Linear Codes
Intersection of Isomorphic Linear Codes
✍ Eli Bar-Yahalom; Tuvi Etzion 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 308 KB

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

Covering arrays and intersecting codes
Covering arrays and intersecting codes
✍ N. J. A. Sloane 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

A t-covering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved by Rkn

An intersection problem for codes
An intersection problem for codes
✍ P. Frankl 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Let [s]" denote all sequences a' = (a,, . . , a,) of integers with 1 <xi 2 S. Consider a subset A of [s]". It is called (t,, . . , &)-intersecting if for any two members ci, b E A and any 1 s i < s

Intersections ofq-ary perfect codes
Intersections ofq-ary perfect codes
✍ F. I. Solov’eva; A. V. Los’ 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 175 KB