Sciweavers

34 search results - page 3 / 7
» Linear-time encodable and decodable error-correcting codes
Sort
View
ICIP
2008
IEEE
14 years 9 months ago
Estimation of optimum coding redundancy and frequency domain analysis of attacks for YASS - a randomized block based hiding sche
Our recently introduced JPEG steganographic method called Yet Another Steganographic Scheme (YASS) can resist blind steganalysis by embedding data in the discrete cosine transform...
Anindya Sarkar, Lakshmanan Nataraj, B. S. Manjunat...
TIT
2008
101views more  TIT 2008»
13 years 7 months ago
Low-Rate Repeat-Zigzag-Hadamard Codes
In this paper, we propose a new class of low-rate error correction codes called repeat-zigzag-Hadamard (RZH) codes featuring simple encoder and decoder structures, and flexible cod...
Kai Li, Guosen Yue, Xiaodong Wang, Li Ping
IOLTS
2005
IEEE
125views Hardware» more  IOLTS 2005»
14 years 1 months ago
Design of a Self Checking Reed Solomon Encoder
— In this paper, an innovative self-checking Reed Solomon encoder architecture is described. The presented architecture exploits some properties of the arithmetic operations in G...
Gian-Carlo Cardarilli, Salvatore Pontarelli, Marco...
FOCS
2003
IEEE
14 years 27 days ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Dirty Paper Coding using Sign-bit Shaping and LDPC Codes
Dirty paper coding (DPC) refers to methods for pre-subtraction of known interference at the transmitter of a multiuser communication system. There are numerous applications for DPC...
G. Shilpa, Andrew Thangaraj, Srikrishna Bhashyam