Add to ORKGGeometrical transformations bring synchronization problems into the robust digital data-hiding. Previous works on this subject were concentrated on the robustness to particular geometrical transformations. In this paper, the achievable rates of reliable robust data-hiding in channels with geometrical transformations are investigated from an informationtheoretic point of view for theoretical set-ups, where lengths of data sequences asymptotically approach infinity. 1
The action of a noise operator on a code transforms it into a distribution on the respective space. ...
In this paper we examine the problem of linear and nonlinear secure network coding from a finite geo...
ABSTRACTIn this paper, we present a new approach for data hiding in digital images by using multiple...
Geometrical transformations bring synchronization problems into the robust digital data-hiding. Prev...
In a data hiding communications scenario, geometrical attacks lead to a loss of reliable communicati...
In this paper we analyze performance of practical robust data-hiding in channels with geometrical tr...
In this paper we analyze security of robust data-hiding in channels with geometrical transformations...
In this paper we analyze security of robust data-hiding in channels with geometrical transformations...
A digital watermark is a message robustly hidden within another digitized signal such as an image, a...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
Linear block noise-proof codes constructed according to algebraic curves (algebraic geometric codes)...
This work studies stegocodes (data-hiding codes) for covert communication over timing channels. In a...
Abstract Data hiding aims to embed a secret message into a digital object such as image by slightly ...
International audienceWe study the first- and second-order asymptotics of covert communication over ...
Asymptotically good sequences of linear ramp secret sharing schemes have been intensively studied by...
The action of a noise operator on a code transforms it into a distribution on the respective space. ...
In this paper we examine the problem of linear and nonlinear secure network coding from a finite geo...
ABSTRACTIn this paper, we present a new approach for data hiding in digital images by using multiple...
Geometrical transformations bring synchronization problems into the robust digital data-hiding. Prev...
In a data hiding communications scenario, geometrical attacks lead to a loss of reliable communicati...
In this paper we analyze performance of practical robust data-hiding in channels with geometrical tr...
In this paper we analyze security of robust data-hiding in channels with geometrical transformations...
In this paper we analyze security of robust data-hiding in channels with geometrical transformations...
A digital watermark is a message robustly hidden within another digitized signal such as an image, a...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
Linear block noise-proof codes constructed according to algebraic curves (algebraic geometric codes)...
This work studies stegocodes (data-hiding codes) for covert communication over timing channels. In a...
Abstract Data hiding aims to embed a secret message into a digital object such as image by slightly ...
International audienceWe study the first- and second-order asymptotics of covert communication over ...
Asymptotically good sequences of linear ramp secret sharing schemes have been intensively studied by...
The action of a noise operator on a code transforms it into a distribution on the respective space. ...
In this paper we examine the problem of linear and nonlinear secure network coding from a finite geo...
ABSTRACTIn this paper, we present a new approach for data hiding in digital images by using multiple...