On some connections between permutations and coding
✍ Scribed by J. Dénes
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 365 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
The aim of this paper is twofold: namely, to show how to use permutation coding for voice and to show how permutation coding helps parallel computation.
Besides that mutants will play an important role in this paper.
📜 SIMILAR VOLUMES
We explore the relations between Langford (2, m, 3m)-sequences on the one hand and complete and addtive permutations on the other. We consider in this context permutations with a certain "splitting" property and report on the results of some computer studies.
## Abstract We study modal logics based on neighbourhood semantics using methods and theorems having their origin in topological model theory. We thus obtain general results concerning completeness of modal logics based on neighbourhood semantics as well as the relationship between neighbourhood an
In this paper we establish a connection between polarized partition relations and the function A q (n, d) of coding theory, which implies some known results and new examples of polarized relations. A connection between A q (n, d) and the Zarankiewicz numbers is also discussed.