Constructing Sequential Bijections
نویسندگان
چکیده
We state a simple condition on a rational subset X of a free monoid B for the existence of a sequential function that is a one-to-one mapping of some free monoid A onto X. As a by-product we obtain new sequential bijections of a free monoid onto another.
منابع مشابه
New Construction of Differentially 4-Uniform Bijections
Block ciphers use Substitution boxes (S-boxes) to create confusion into the cryptosystems. For resisting the known attacks on these cryptosystems, the following criteria for functions are mandatory: low differential uniformity, high nonlinearity and not low algebraic degree. Bijectivity is also necessary if the cipher is a Substitution-Permutation Network, and balancedness makes a Feistel ciphe...
متن کاملGrothendieck Rings of Laurent Series Fields
We study Grothendieck rings (in the sense of logic) of fields. We prove the triviality of the Grothendieck rings of certain fields by constructing definable bijections which imply the triviality. More precisely, we consider valued fields, for example, fields of Laurent series over the real numbers, over p-adic numbers and over finite fields, and construct definable bijections from the line to t...
متن کاملUnified parallel encoding and decoding algorithms for Dandelion-like codes
The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported. In this paper the first parallel encoding and decoding algorithms for Dandelion-like codes are presented. Namely, a unique encoding algorithm and a unique decoding algorithm, whi...
متن کاملDifferentially 4-uniform bijections by permuting the inverse function
Block ciphers use Substitution boxes (S-boxes) to create confusion into the cryptosystems. Functions used as S-boxes should have low differential uniformity, high nonlinearity and algebraic degree larger than 3 (preferably strictly larger). They should be fastly computable; from this viewpoint, it is better when they are in even number of variables. In addition, the functions should be bijectio...
متن کاملFinding direct partition bijections by two-directional rewriting techniques
One basic activity in combinatorics is to establish combinatorial identities by so-called ‘bijective proofs,’ which consists in constructing explicit bijections between two types of the combinatorial objects under consideration. We show how such bijective proofs can be established in a systematic way from the ‘lattice properties’ of partition ideals, and how the desired bijections are computed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997