Intersection sets, three-character multisets and associated codes
نویسندگان
چکیده
منابع مشابه
Intersection sets, three-character multisets and associated codes
In this article we construct new minimal intersection sets in AG(r, q2) sporting three intersection numbers with hyperplanes; we then use these sets to obtain linear error correcting codes with few weights, whose weight enumerator we also determine. Furthermore, we provide a new family of three-character multisets in PG(r, q2) with r even and we also compute their weight distribution.
متن کاملCodes and Projective Multisets
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that transforms projective codes into two-weight codes. Short proofs of known theorems are obtained. A new notion of self-duality in coding theory is explored. 94B05, 94B27, 51E22.
متن کاملRandomized Sets and Multisets
Sets and multisets are fundamental data structures which are used in numerous distributed algorithms. We investigate randomized versions of sets and multisets and show that our probabilistic approach can improve the performance of systems using our distributed shared data structures. We give algorithms for basic set and multiset operations and prove a number of fundamental properties. We illust...
متن کاملProgramming with Sets and Multisets
I briefly discuss the facilities for programming with sets and multisets provided by the programming language Escher, which is a general-purpose, declarative language that integrates the best features of both functional and logic programming languages. Escher has types and modules, higher-order and meta-programming facilities, concurrency, and declarative input/output. The main design aim is to...
متن کاملSpin-embeddings, two-intersection sets and two-weight codes
Let ∆ be one of the dual polar spaces DQ(8, q), DQ−(7, q), and let e : ∆ → Σ denote the spin-embedding of ∆. We show that e(∆) is a two-intersection set of the projective space Σ. Moreover, if ∆ ∼= DQ−(7, q), then e(∆) is a (q + 1)-tight set of a nonsingular hyperbolic quadric Q(7, q) of Σ ∼= PG(7, q). This (q + 1)-tight set gives rise to more examples of (q + 1)-tight sets of hyperbolic quadri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2016
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-016-0302-8