Gray codes with restricted density
โ Scribed by Marshall Buck; Doug Wiedemann
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 375 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let ฯ be a partition of the positive integer n. A partition of the set X n = {1, 2, . . . , n} is said to be of type ฯ if the sizes of its classes form the partition ฯ of n. Given 1 < r < n, an r element subset A of X n and a partition ฯ of X n are said to be orthogonal if every class of ฯ meets A i
The Partition Type Conjecture, a generalization of the Middle Levels Conjecture of combinatorics, states that for all positive integers n and r, with n > r > 1, and every non-exceptional partition type ฯ of weight r of X n , there exists a constant weight Gray code which admits an orthogonal labelin
## Abstract Emotional Intelligence (EI) is the ability to monitor one's own and others' emotions and the ability to use the gathered information to guide one's thinking and action. EI is thought to be important for social life making it a popular subject of research. However, despite the existence
Lee weight is more appropriate for some practical situations than Hamming weight as it takes into account magnitude of each digit of the word. In this paper, considering Lee weight, we obtain necessary lower bound over the number of parity checks to correct bursts of length b (fixed) whose weight li