Related papers: A code space for a generalized IFS
The notion of $\ast$-measure on a compact Hausdorff space can be defined for arbitrary continuous triangular norm $\ast$. The well-known Hutchinson-Barnsley theory deals with the iterated function systems (IFSs) of probability measures and…
This paper is the first paper of three papers in a series, which intend to provide a systematic treatment for the space-filling curves of self-similar sets. In the present paper, we introduce a notion of \emph{linear graph-directed IFS}…
The present article is devoted to the investigation of some properties of the generalized shift operator of numbers represented in terms of numeral systems with a variable alphabet.
We apply some methods and technique of complex dynamics to study the set of symmetries of attractors of holomorphic Iterated Function Systems (IFS), as well as relations between IFS sharing the same attractor.
We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…
This paper studies a general class of Iterated Function Systems (IFS). No contractivity assumptions are made, other than the existence of some compact attractor. The possibility of escape to infinity is considered. Our present approach is…
Iterated Function Systems (IFSs) have been at the heart of fractal geometry almost from its origin, and several generalizations for the notion of IFS have been suggested. Subdivision schemes are widely used in computer graphics and attempts…
The attractors of iterated function systems are usually obtained as the Hausdorff limit of any non-empty compact subset under iteration. In this note we show that an iterated function system on a boundedly compact metric space has compact,…
We present algorithms to compute approximations of invariant measures and its attractors for IFS and GIFS, using the deterministic algorithm in a tractable way, with code optimization strategies and use of data structures and search…
We provide an overview of iterated function systems (IFS), where randomly chosen state-to-state maps are applied iteratively to a state. We aim to summarize the state of art and, where possible, identify fundamental challenges and…
A general class of the almost instantaneous fixed-to-variable-length (AIFV) codes is proposed, which contains every possible binary code we can make when allowing finite bits of decoding delay. The contribution of the paper lies in the…
Iterated function systems (IFS) can be a surprisingly useful tool for studying structure in data. Here we present results stemming from a 2013 computational study by the author using IFS. The results include fractal patterns that reveal…
The concept of Generalized Inverse based Decoding (GID) is introduced, as an algebraic framework for the syndrome decoding problem (SDP) and low weight codeword problem (LWP). The framework has ground on two characterizations by generalized…
This paper is in the form of an essay. It defines fractal tops and code space structures associated with set-attractors of hyperbolic iterated function systems (IFSs). The fractal top of an IFS is associated with a certain shift invariant…
The intention of this article is to introduce a generalization of Proinov-type contraction via simulation functions. We name this generalized contraction map as Proinov-type Z-contraction. This article establishes the existence and…
A shift-invariant space is a space of functions that is invariant under integer translations. Such spaces are often used as models for spaces of signals and images in mathematical and engineering applications. This paper characterizes those…
This paper introduces a new class of iterated function systems (IFSs) called R-IFSs, which include both rotation/reflection maps and contraction maps. The study of R-IFSs is motivated by the recent research direction on enriching IFSs by…
We study countable compact spaces as potential attractors of iterated function systems. We give an example of a convergent sequence in the real line which is not an IFS-attractor and for each countable ordinal $\delta$ we show that a…
We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…
We introduce the discrete version of the Hutchinson--Barnsley theory providing algorithms to approximate the Hutchinson measure for iterated function systems (IFS) and generalized iterated function systems (GIFS) complementing the discrete…