This is an announcement for the paper "On greedy algorithms with respect to generalized Walsh system" by Sergo A. Episkoposian. Abstract: In this paper we proof that there exists a function f(x) belongs to L^1[0,1] such that a greedy algorithm with regard to generalized Walsh system does not converge to f(x) in L^1[0,1] norm, i.e. the generalized Walsh system is not a quasi-greedy basis in its linear span L^1[0,1]. Archive classification: math.FA Mathematics Subject Classification: 42C10, 46E30 Submitted from: sergoep@ysu.am The paper may be downloaded from the archive by web browser from URL http://front.math.ucdavis.edu/1109.3806 or http://arXiv.org/abs/1109.3806