𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of a superimposed code using partitions

✍ Scribed by Vladimir Ufimtsev

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
102 KB
Volume
63
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

✦ Synopsis

This paper will focus on the construction of superimposed codes using incidence matrices. Such constructions require a set of elements and a partial order defined on the set. We will define a partial order on partitions. The construction will be made using elements from the partially ordered set of partitions of n elements.

πŸ“œ SIMILAR VOLUMES

The construction of periodically time-va
The construction of periodically time-variant convolutional codes using binary linear block codes
✍ Naonori Ogasahara; Manabu Kobayashi; Shigeichi Hirasawa πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 483 KB

## Abstract In 1996 Rosenthal and York proposed (time‐invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.

The Use of Iteration Space Partitioning
The Use of Iteration Space Partitioning to Construct Representative Simple Sections
✍ Aart J.C. Bik; Harry A.G. Wijshoff πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 516 KB

A method is presented of constructing a number of regions in a 2-dimensional array such that all accesses that can be induced by an arbitrary occurrence of this array in a program are limited to one of these regions. The index set of such regions will be described in terms of 2-dimensional simple se