On the capacity of computer memory with defects

Heegard, C.; Gamal, Abbas El

doi:10.1109/tit.1983.1056723

Cited by 287 publications

(292 citation statements)

References 10 publications

Supporting

Mentioning

287

Contrasting

Unclassified

Order By: Relevance

“…The recipient does not know the set S. This is an example of a channel known as an n-bit memory with up to n -k defective cells introduced in 1974 by Kuznetsov et al [14]. It is known that the Shannon capacity of this channel is k/n [15][16][17] and can be achieved for non-binary alphabets using an algebraic coding scheme with the cosets of an MDS code as bins [16]. The same paper contains a noisy generalization of this channel and shows that nested linear codes (or "partitioned" codes) are capable of achieving the theoretical maximum capacity.…”

Section: Example 3 (Jpeg Compression)mentioning

confidence: 99%

“…This setup is an example of coset coding. The message is communicated as a syndrome with parity check matrix H. As opposed to the approach by Heegard [15] who proposed a fixed rate code for memory with defective cells, we use a variable rate random linear code with a pseudo-random matrix. This randomization offers flexibility for our steganographic application in which k varies greatly depending on the cover object and a steganographic method.…”

Section: Encoder and Decodermentioning

confidence: 99%

“…To prove the other implication, from the Euclid theorem [21], there are two integers a and b such that aq ij (1) + bq ij (2) = g. After multiplying this equation by q ij (2) /(2g), which is an integer, we obtain (14) with k = aq ij (2) /(2g) and l = -bq ij (2) /(2g). To derive the formula (15), from (14) we have…”

Section: Coefficient Selection Rulementioning

confidence: 99%

See 2 more Smart Citations

Perturbed quantization steganography

2005

View full text Add to dashboard Cite

In this paper, we use the recently proposed wet paper codes and introduce a new approach to passive-warden steganography called Perturbed Quantization. In Perturbed Quantization, the sender hides data while processing the cover object with an informationreducing operation that involves quantization, such as lossy compression, downsampling, or A/D conversion. The unquantized values of the processed cover object are considered as side information to confine the embedding changes to those unquantized elements whose values are close to the middle of quantization intervals. This choice of the selection channel calls for wet paper codes as they enable communication with nonshared selection channel. Heuristic is presented that indicates that the proposed method provides better steganographic security than current JPEG steganographic methods. This claim is further supported by blind steganalysis of a specific case of Perturbed Quantization for recompressed JPEG images. KeywordsPerturbed quantization, wet paper code, adaptive, security, steganography MOTIVATIONThe primary goal of steganography is to build a statistically undetectable communication channel (the famous Prisoner Problem [1]). In order to embed a secret message, the sender slightly modifies the cover object to obtain the embedded stego object. In steganography under the passive warden scenario [2,3], the goal is to communicate as many bits as possible without introducing any detectable artifacts into the cover object. Attempts to give a formal definition of the concept of steganographic security can be found in [4][5][6]. In practice, a steganographic scheme is considered secure if no existing attack can be modified to build a detector that would be able to distinguish between cover and stego images with a success better than random guessing [7].One possible measure to improve the security of steganographic schemes for digital media is to embed the message in adaptively selected components of the cover object [8][9][10], such as noisy areas or segments with a complex texture. However, if the adaptive selection rule is public or only "weakly dependent on a key", the attacker can apply the same rule and start building an attack. It is then a valid question whether the adaptive selection improves steganographic security at all. An interesting example of a scheme where adaptive pixel selection in fact decreased its security is the recent surprising result of Westfeld [11].This problem with adaptive steganography could be remedied if the selection rule was determined from some side information available only to the sender but in principle unavailable to the attacker. For example, imagine the situation when the sender has a raw, uncompressed image and wants to embed data into its JPEG compressed form. Can the sender use his side informationthe uncompressed image -to construct a better JPEG steganography? We can attempt to select for embedding those DCT coefficients whose unquantized values lie "close to the middle" of quantization intervals. Intuitively, p...

show abstract

Section: Example 3 (Jpeg Compression)mentioning

confidence: 99%

Section: Encoder and Decodermentioning

confidence: 99%

See 1 more Smart Citation

Perturbed quantization steganography

2005

View full text Add to dashboard Cite

show abstract

“…We also neglect the small O log n n term. We consider the memory with stuck-at faults example [54] (see also [1,Example 7.3]). The state S = 0 correspond to a faculty memory cell that output 0 independent of the input value, the state S = 1 corresponds to a faculty memory cell that outputs 1 independent of the input value, and the state S = 2 corresponds to a binary symmetric channel with crossover probability α.…”

Section: B Numerical Example For Gp Problemmentioning

confidence: 99%

Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

Watanabe

Kuzuoka

Tan

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the WynerAhlswede-Körner (WAK) problem of almost-lossless source coding with rate-limited side-information, (ii) the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder and (iii) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems improve on all previous non-asymptotic bounds on the error probability of the WAK, WZ and GP problems-in particular those derived by Verdú. Using our novel non-asymptotic bounds, we recover the general formulas for the optimal rates of these side-information problems. Finally, we also present achievable second-order coding rates by applying the multidimensional Berry-Esséen theorem to our new non-asymptotic bounds. Numerical results show that the second-order coding rates obtained using our non-asymptotic achievability bounds are superior to those obtained using existing finite blocklength bounds.

show abstract

“…The main problem was to establish the highest possible rates of reliable communications in such channels [3]- [6] that is related to the optimal solution to the problem of channel interference cancellation.…”

mentioning

confidence: 99%

On reversible information hiding system

Haroutunian

Tonoyan

Koval

et al. 2008

2008 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-In this paper we consider the problem of reversible information hiding in the case when the attacker uses only discrete memoryless channels (DMC), the decoder knows only the class of channels, but not the DMC chosen by the attacker, the attacker knows the information-hiding strategy, probability distributions of all random variables, but not the side information.We introduce the notion of reversible information hiding Ecapacity, which expresses the dependence of the information hiding rate on the error probability exponent E and the distortion levels for the information hider, for the attacker and for the host data approximation. The random coding bound for reversible information hiding E-capacity is found. We obtain the lower bound for reversibility information hiding capacity for E → 0.In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.I. INTRODUCTION Problem of information transmission over state dependent channels rises in the situation when the transmitter has a certain prior knowledge about the environment or channel. Such a situation is typical in data hiding where the main goal is to communicate information message embedded into the body of a media file over a certain channel [1]. It is also relevant to simultaneous transmission of digital and analog information in audio broadcasting [2].A corresponding research area of communications over channels with side information available at the transmitter has attracted considerable attention in information theory. The main problem was to establish the highest possible rates of reliable communications in such channels [3]-[6] that is related to the optimal solution to the problem of channel interference cancellation.However, in certain cases one is rather interested not in maximizing the rate of pure information transmission [7] but in the most accurate estimate of the channel interference (channel state). Such a problem arises in simultaneous broadcasting of analog and digital audio [2] where digital data designed in a way to enhance the overall reception quality can be considered as interference degrading the communication of analog information.The problem of accurate channel state estimation at the output of the state-dependent channel (reversibility) was studied in communication and data hiding formulation. Sutivong et al. [7] considered the problem of simultaneous channel state transmission in addition to the pure information. They present the optimal protocol design and rate distortion region for pure

show abstract

On the capacity of computer memory with defects

Cited by 287 publications

References 10 publications

Perturbed quantization steganography

Perturbed quantization steganography

Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

On reversible information hiding system

Contact Info

Product

Resources

About