Sciweavers

212 search results - page 3 / 43
» On the Locality of Codeword Symbols
Sort
View
ICCD
2002
IEEE
98views Hardware» more  ICCD 2002»
14 years 3 months ago
Parallel Multiple-Symbol Variable-Length Decoding
In this paper, a parallel Variable-Length Decoding (VLD) scheme is introduced. The scheme is capable of decoding all the codewords in an N-bit buffer whose accumulated codelength ...
Jari Nikara, Stamatis Vassiliadis, Jarmo Takala, M...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 6 months ago
Communication under Strong Asynchronism
We consider asynchronous communication over point-to-point discrete memoryless channels without feedback. The transmitter starts sending one block codeword at an instant that is u...
Aslan Tchamkerten, Venkat Chandar, Gregory W. Worn...
FTTCS
2006
106views more  FTTCS 2006»
13 years 6 months ago
Algorithmic Results in List Decoding
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redunda...
Venkatesan Guruswami
CP
2009
Springer
14 years 7 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
SARA
2009
Springer
14 years 24 days ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...