Capacity and Codes for Embedding Information in Gray-Scale Signals
نویسندگان
چکیده
منابع مشابه
simulation and experimental studies for prediction mineral scale formation in oil field during mixing of injection and formation water
abstract: mineral scaling in oil and gas production equipment is one of the most important problem that occurs while water injection and it has been recognized to be a major operational problem. the incompatibility between injected and formation waters may result in inorganic scale precipitation in the equipment and reservoir and then reduction of oil production rate and water injection rate. ...
Gray codes for reflection groups
Let G be a finite group generated by reflections. It is shown that the elements of G can be arranged in a cycle (a "Gray. code") such that each element is obtained from the previous one by applying one of the generators. The case G = d[ ' yields a conventional binary Gray code. These generalized Gray codes provide an efficient wa), to run through the elements of any finite reflection group.
متن کاملGray codes for reflectable languages
We classify a type of language called a reflectable language. We then develop a generic algorithm that can be used to list all strings of length n for any reflectable language in Gray code order. The algorithm generalizes Gray code algorithms developed independently for k-ary strings, restricted growth strings, and k-ary trees, as each of these objects can be represented by a reflectable langua...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
Gray codes and symmetric chains
We consider the problem of constructing a cyclic listing of all bitstrings of length 2n+1 with Hamming weights in the interval [n+1−`, n+`], where 1 ≤ ` ≤ n+1, by flipping a single bit in each step. This is a far-ranging generalization of the wellknown middle two levels problem (the case ` = 1). We provide a solution for the case ` = 2 and solve a relaxed version of the problem for general valu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2005
ISSN: 0018-9448
DOI: 10.1109/tit.2004.842707