Sciweavers

132 search results - page 9 / 27
» On correctable errors of binary linear codes
Sort
View
VLSID
2005
IEEE
124views VLSI» more  VLSID 2005»
14 years 2 months ago
Design of a Reversible Binary Coded Decimal Adder by Using Reversible 4-Bit Parallel Adder
In this paper, we have proposed a design technique for the reversible circuit of Binary Coded Decimal (BCD) adder. The proposed circuit has the ability to add two 4bits binary var...
Hafiz Md. Hasan Babu, Ahsan Raja Chowdhury
STACS
2010
Springer
14 years 3 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 8 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 10 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
DCC
2002
IEEE
14 years 8 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic